./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 35987657 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-?-3598765 [2022-07-21 09:56:47,518 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 09:56:47,520 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 09:56:47,575 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 09:56:47,575 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 09:56:47,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 09:56:47,580 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 09:56:47,582 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 09:56:47,583 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 09:56:47,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 09:56:47,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 09:56:47,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 09:56:47,591 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 09:56:47,592 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 09:56:47,593 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 09:56:47,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 09:56:47,596 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 09:56:47,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 09:56:47,598 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 09:56:47,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 09:56:47,603 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 09:56:47,604 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 09:56:47,605 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 09:56:47,606 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 09:56:47,607 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 09:56:47,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 09:56:47,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 09:56:47,610 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 09:56:47,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 09:56:47,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 09:56:47,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 09:56:47,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 09:56:47,613 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 09:56:47,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 09:56:47,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 09:56:47,615 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 09:56:47,616 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 09:56:47,616 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 09:56:47,616 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 09:56:47,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 09:56:47,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 09:56:47,618 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 09:56:47,619 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 09:56:47,646 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 09:56:47,646 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 09:56:47,646 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 09:56:47,647 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 09:56:47,647 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 09:56:47,647 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 09:56:47,648 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 09:56:47,648 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 09:56:47,648 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 09:56:47,649 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 09:56:47,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 09:56:47,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 09:56:47,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 09:56:47,650 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 09:56:47,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 09:56:47,650 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 09:56:47,650 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 09:56:47,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 09:56:47,651 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 09:56:47,651 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 09:56:47,651 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 09:56:47,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:56:47,652 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 09:56:47,652 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 09:56:47,652 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 09:56:47,652 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 09:56:47,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 09:56:47,652 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 09:56:47,653 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 09:56:47,653 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 09:56:47,653 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-21 09:56:47,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 09:56:47,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 09:56:47,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 09:56:47,911 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 09:56:47,912 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 09:56:47,914 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-21 09:56:47,981 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/545a96440/1b698447be6f4b03be4b34181558d2ed/FLAG7309aca9f [2022-07-21 09:56:48,581 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 09:56:48,582 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-21 09:56:48,615 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/545a96440/1b698447be6f4b03be4b34181558d2ed/FLAG7309aca9f [2022-07-21 09:56:49,007 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/545a96440/1b698447be6f4b03be4b34181558d2ed [2022-07-21 09:56:49,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 09:56:49,009 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 09:56:49,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 09:56:49,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 09:56:49,013 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 09:56:49,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:56:49" (1/1) ... [2022-07-21 09:56:49,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cfb72b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:56:49, skipping insertion in model container [2022-07-21 09:56:49,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:56:49" (1/1) ... [2022-07-21 09:56:49,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 09:56:49,103 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 09:56:49,967 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-21 09:56:50,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:56:50,060 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 09:56:50,244 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-21 09:56:50,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:56:50,466 INFO L208 MainTranslator]: Completed translation [2022-07-21 09:56:50,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:56:50 WrapperNode [2022-07-21 09:56:50,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 09:56:50,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 09:56:50,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 09:56:50,469 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 09:56:50,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:56:50" (1/1) ... [2022-07-21 09:56:50,512 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:56:50" (1/1) ... [2022-07-21 09:56:50,594 INFO L137 Inliner]: procedures = 142, calls = 839, calls flagged for inlining = 59, calls inlined = 40, statements flattened = 1679 [2022-07-21 09:56:50,595 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 09:56:50,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 09:56:50,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 09:56:50,596 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 09:56:50,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:56:50" (1/1) ... [2022-07-21 09:56:50,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:56:50" (1/1) ... [2022-07-21 09:56:50,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:56:50" (1/1) ... [2022-07-21 09:56:50,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:56:50" (1/1) ... [2022-07-21 09:56:50,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:56:50" (1/1) ... [2022-07-21 09:56:50,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:56:50" (1/1) ... [2022-07-21 09:56:50,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:56:50" (1/1) ... [2022-07-21 09:56:50,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 09:56:50,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 09:56:50,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 09:56:50,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 09:56:50,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:56:50" (1/1) ... [2022-07-21 09:56:50,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:56:50,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:56:50,765 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-21 09:56:50,799 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-21 09:56:50,811 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-21 09:56:50,812 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-21 09:56:50,812 INFO L130 BoogieDeclarations]: Found specification of procedure catc_tx_run [2022-07-21 09:56:50,812 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_tx_run [2022-07-21 09:56:50,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-21 09:56:50,812 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-21 09:56:50,813 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-21 09:56:50,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-21 09:56:50,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-21 09:56:50,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 09:56:50,813 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-21 09:56:50,813 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-21 09:56:50,813 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-21 09:56:50,813 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-21 09:56:50,813 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_run [2022-07-21 09:56:50,814 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_run [2022-07-21 09:56:50,814 INFO L130 BoogieDeclarations]: Found specification of procedure catc_get_drvinfo [2022-07-21 09:56:50,814 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_get_drvinfo [2022-07-21 09:56:50,814 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_msg [2022-07-21 09:56:50,814 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_msg [2022-07-21 09:56:50,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-21 09:56:50,814 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-21 09:56:50,814 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-21 09:56:50,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-21 09:56:50,815 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 09:56:50,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 09:56:50,815 INFO L130 BoogieDeclarations]: Found specification of procedure catc_multicast [2022-07-21 09:56:50,815 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_multicast [2022-07-21 09:56:50,815 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-21 09:56:50,815 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-21 09:56:50,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 09:56:50,816 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-21 09:56:50,816 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-21 09:56:50,816 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-07-21 09:56:50,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-07-21 09:56:50,816 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-21 09:56:50,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-21 09:56:50,816 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-21 09:56:50,817 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-21 09:56:50,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-21 09:56:50,817 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-21 09:56:50,817 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-21 09:56:50,817 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-21 09:56:50,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 09:56:50,817 INFO L130 BoogieDeclarations]: Found specification of procedure crc32_le [2022-07-21 09:56:50,818 INFO L138 BoogieDeclarations]: Found implementation of procedure crc32_le [2022-07-21 09:56:50,818 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-21 09:56:50,818 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-21 09:56:50,818 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-21 09:56:50,818 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-21 09:56:50,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 09:56:50,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 09:56:50,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 09:56:50,819 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_async [2022-07-21 09:56:50,819 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_async [2022-07-21 09:56:50,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 09:56:50,820 INFO L130 BoogieDeclarations]: Found specification of procedure catc_exit [2022-07-21 09:56:50,820 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_exit [2022-07-21 09:56:50,820 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-21 09:56:50,821 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-21 09:56:50,821 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-21 09:56:50,821 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-21 09:56:50,821 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-21 09:56:50,821 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-21 09:56:50,821 INFO L130 BoogieDeclarations]: Found specification of procedure catc_init [2022-07-21 09:56:50,822 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_init [2022-07-21 09:56:50,822 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-21 09:56:50,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-21 09:56:50,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 09:56:50,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 09:56:50,842 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-21 09:56:50,842 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-21 09:56:50,842 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-07-21 09:56:50,842 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-07-21 09:56:50,842 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-21 09:56:50,842 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-21 09:56:50,842 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-21 09:56:50,842 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-21 09:56:50,843 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-21 09:56:50,843 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-21 09:56:50,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-07-21 09:56:50,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-07-21 09:56:50,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 09:56:50,843 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-21 09:56:50,843 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-21 09:56:50,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-21 09:56:50,843 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-07-21 09:56:50,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 09:56:50,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 09:56:51,199 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 09:56:51,200 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 09:56:51,750 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-07-21 09:56:51,825 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 09:56:51,830 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 09:56:52,526 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2022-07-21 09:56:52,526 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2022-07-21 09:56:52,526 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-07-21 09:56:52,527 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-07-21 09:56:52,554 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 09:56:52,567 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 09:56:52,568 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-07-21 09:56:52,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:56:52 BoogieIcfgContainer [2022-07-21 09:56:52,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 09:56:52,571 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 09:56:52,571 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 09:56:52,572 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 09:56:52,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 09:56:49" (1/3) ... [2022-07-21 09:56:52,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@106ac245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:56:52, skipping insertion in model container [2022-07-21 09:56:52,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:56:50" (2/3) ... [2022-07-21 09:56:52,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@106ac245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:56:52, skipping insertion in model container [2022-07-21 09:56:52,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:56:52" (3/3) ... [2022-07-21 09:56:52,574 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-07-21 09:56:52,597 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 09:56:52,598 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 09:56:52,633 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 09:56:52,638 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@16f284bf, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@52639769 [2022-07-21 09:56:52,638 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 09:56:52,652 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-21 09:56:52,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 09:56:52,660 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:56:52,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:56:52,661 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:56:52,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:56:52,665 INFO L85 PathProgramCache]: Analyzing trace with hash -701775118, now seen corresponding path program 1 times [2022-07-21 09:56:52,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:56:52,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762254826] [2022-07-21 09:56:52,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:56:52,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:56:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:53,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:56:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:53,061 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-21 09:56:53,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:56:53,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762254826] [2022-07-21 09:56:53,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762254826] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:56:53,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:56:53,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 09:56:53,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870534292] [2022-07-21 09:56:53,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:56:53,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:56:53,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:56:53,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:56:53,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:56:53,093 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-21 09:56:53,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:56:53,250 INFO L93 Difference]: Finished difference Result 1092 states and 1610 transitions. [2022-07-21 09:56:53,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 09:56:53,252 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-21 09:56:53,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:56:53,267 INFO L225 Difference]: With dead ends: 1092 [2022-07-21 09:56:53,267 INFO L226 Difference]: Without dead ends: 548 [2022-07-21 09:56:53,275 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-21 09:56:53,278 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-21 09:56:53,279 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-21 09:56:53,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-07-21 09:56:53,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 543. [2022-07-21 09:56:53,338 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-21 09:56:53,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 710 transitions. [2022-07-21 09:56:53,348 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 710 transitions. Word has length 17 [2022-07-21 09:56:53,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:56:53,349 INFO L495 AbstractCegarLoop]: Abstraction has 543 states and 710 transitions. [2022-07-21 09:56:53,349 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-21 09:56:53,349 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 710 transitions. [2022-07-21 09:56:53,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 09:56:53,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:56:53,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:56:53,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 09:56:53,350 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:56:53,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:56:53,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1094802128, now seen corresponding path program 1 times [2022-07-21 09:56:53,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:56:53,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269821464] [2022-07-21 09:56:53,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:56:53,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:56:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:53,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:56:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:53,447 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-21 09:56:53,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:56:53,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269821464] [2022-07-21 09:56:53,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269821464] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:56:53,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:56:53,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 09:56:53,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282555530] [2022-07-21 09:56:53,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:56:53,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:56:53,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:56:53,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:56:53,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 09:56:53,453 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-21 09:56:53,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:56:53,533 INFO L93 Difference]: Finished difference Result 1589 states and 2102 transitions. [2022-07-21 09:56:53,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:56:53,533 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-21 09:56:53,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:56:53,540 INFO L225 Difference]: With dead ends: 1589 [2022-07-21 09:56:53,540 INFO L226 Difference]: Without dead ends: 1064 [2022-07-21 09:56:53,541 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-21 09:56:53,543 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-21 09:56:53,544 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-21 09:56:53,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2022-07-21 09:56:53,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1061. [2022-07-21 09:56:53,606 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-21 09:56:53,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1396 transitions. [2022-07-21 09:56:53,612 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1396 transitions. Word has length 17 [2022-07-21 09:56:53,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:56:53,612 INFO L495 AbstractCegarLoop]: Abstraction has 1061 states and 1396 transitions. [2022-07-21 09:56:53,613 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-21 09:56:53,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1396 transitions. [2022-07-21 09:56:53,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 09:56:53,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:56:53,613 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-21 09:56:53,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 09:56:53,614 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:56:53,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:56:53,619 INFO L85 PathProgramCache]: Analyzing trace with hash 420612946, now seen corresponding path program 1 times [2022-07-21 09:56:53,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:56:53,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688594706] [2022-07-21 09:56:53,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:56:53,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:56:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:53,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:56:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:53,716 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-21 09:56:53,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:56:53,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688594706] [2022-07-21 09:56:53,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688594706] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:56:53,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:56:53,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 09:56:53,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309874225] [2022-07-21 09:56:53,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:56:53,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:56:53,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:56:53,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:56:53,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 09:56:53,718 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-21 09:56:53,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:56:53,737 INFO L93 Difference]: Finished difference Result 1063 states and 1397 transitions. [2022-07-21 09:56:53,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:56:53,738 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-21 09:56:53,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:56:53,743 INFO L225 Difference]: With dead ends: 1063 [2022-07-21 09:56:53,743 INFO L226 Difference]: Without dead ends: 1052 [2022-07-21 09:56:53,744 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-21 09:56:53,744 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-21 09:56:53,745 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-21 09:56:53,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2022-07-21 09:56:53,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1047. [2022-07-21 09:56:53,776 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-21 09:56:53,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1376 transitions. [2022-07-21 09:56:53,781 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1376 transitions. Word has length 18 [2022-07-21 09:56:53,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:56:53,781 INFO L495 AbstractCegarLoop]: Abstraction has 1047 states and 1376 transitions. [2022-07-21 09:56:53,782 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-21 09:56:53,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1376 transitions. [2022-07-21 09:56:53,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-21 09:56:53,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:56:53,785 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-21 09:56:53,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 09:56:53,785 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:56:53,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:56:53,785 INFO L85 PathProgramCache]: Analyzing trace with hash -42685748, now seen corresponding path program 1 times [2022-07-21 09:56:53,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:56:53,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341144314] [2022-07-21 09:56:53,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:56:53,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:56:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:53,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:56:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:53,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 09:56:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:53,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 09:56:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:53,880 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-21 09:56:53,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:56:53,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341144314] [2022-07-21 09:56:53,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341144314] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:56:53,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:56:53,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:56:53,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453525876] [2022-07-21 09:56:53,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:56:53,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:56:53,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:56:53,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:56:53,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:56:53,882 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-21 09:56:54,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:56:54,801 INFO L93 Difference]: Finished difference Result 2403 states and 3232 transitions. [2022-07-21 09:56:54,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 09:56:54,801 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-21 09:56:54,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:56:54,807 INFO L225 Difference]: With dead ends: 2403 [2022-07-21 09:56:54,807 INFO L226 Difference]: Without dead ends: 1368 [2022-07-21 09:56:54,810 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-21 09:56:54,811 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.9s IncrementalHoareTripleChecker+Time [2022-07-21 09:56:54,811 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.9s Time] [2022-07-21 09:56:54,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2022-07-21 09:56:54,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1346. [2022-07-21 09:56:54,859 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-21 09:56:54,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1824 transitions. [2022-07-21 09:56:54,866 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1824 transitions. Word has length 50 [2022-07-21 09:56:54,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:56:54,866 INFO L495 AbstractCegarLoop]: Abstraction has 1346 states and 1824 transitions. [2022-07-21 09:56:54,866 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-21 09:56:54,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1824 transitions. [2022-07-21 09:56:54,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-21 09:56:54,869 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:56:54,869 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-21 09:56:54,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 09:56:54,869 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:56:54,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:56:54,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1108217249, now seen corresponding path program 1 times [2022-07-21 09:56:54,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:56:54,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893112959] [2022-07-21 09:56:54,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:56:54,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:56:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:54,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:56:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:54,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:56:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:54,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:56:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:54,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:56:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:54,971 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-21 09:56:54,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:56:54,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893112959] [2022-07-21 09:56:54,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893112959] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:56:54,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:56:54,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 09:56:54,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037769161] [2022-07-21 09:56:54,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:56:54,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:56:54,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:56:54,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:56:54,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:56:54,973 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-21 09:56:56,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:56:56,178 INFO L93 Difference]: Finished difference Result 2719 states and 3690 transitions. [2022-07-21 09:56:56,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 09:56:56,179 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-21 09:56:56,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:56:56,186 INFO L225 Difference]: With dead ends: 2719 [2022-07-21 09:56:56,186 INFO L226 Difference]: Without dead ends: 1374 [2022-07-21 09:56:56,191 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-21 09:56:56,192 INFO L413 NwaCegarLoop]: 683 mSDtfsCounter, 183 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:56:56,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1805 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-21 09:56:56,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2022-07-21 09:56:56,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1346. [2022-07-21 09:56:56,242 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-21 09:56:56,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1818 transitions. [2022-07-21 09:56:56,248 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1818 transitions. Word has length 72 [2022-07-21 09:56:56,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:56:56,249 INFO L495 AbstractCegarLoop]: Abstraction has 1346 states and 1818 transitions. [2022-07-21 09:56:56,249 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-21 09:56:56,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1818 transitions. [2022-07-21 09:56:56,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-21 09:56:56,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:56:56,251 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-21 09:56:56,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 09:56:56,252 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:56:56,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:56:56,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1223480200, now seen corresponding path program 1 times [2022-07-21 09:56:56,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:56:56,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060327328] [2022-07-21 09:56:56,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:56:56,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:56:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:56:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:56:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:56:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 09:56:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:56:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:56:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:56:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 09:56:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:56:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:56:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 09:56:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:56:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:56:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 09:56:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:56:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:56:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:56:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:56:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:56:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,499 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-21 09:56:56,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:56:56,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060327328] [2022-07-21 09:56:56,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060327328] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:56:56,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960590118] [2022-07-21 09:56:56,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:56:56,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:56:56,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:56:56,502 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-21 09:56:56,543 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-21 09:56:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:56,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 1884 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-21 09:56:57,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:56:57,122 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-21 09:56:57,139 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-21 09:56:57,185 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-21 09:56:57,185 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:56:57,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960590118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:56:57,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:56:57,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-07-21 09:56:57,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938474254] [2022-07-21 09:56:57,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:56:57,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:56:57,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:56:57,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:56:57,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-21 09:56:57,187 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-21 09:56:58,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:56:58,203 INFO L93 Difference]: Finished difference Result 1408 states and 1898 transitions. [2022-07-21 09:56:58,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:56:58,204 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-21 09:56:58,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:56:58,210 INFO L225 Difference]: With dead ends: 1408 [2022-07-21 09:56:58,210 INFO L226 Difference]: Without dead ends: 1348 [2022-07-21 09:56:58,211 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-21 09:56:58,211 INFO L413 NwaCegarLoop]: 697 mSDtfsCounter, 4 mSDsluCounter, 3226 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 09:56:58,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3923 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 09:56:58,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2022-07-21 09:56:58,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1346. [2022-07-21 09:56:58,244 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-21 09:56:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1816 transitions. [2022-07-21 09:56:58,249 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1816 transitions. Word has length 146 [2022-07-21 09:56:58,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:56:58,250 INFO L495 AbstractCegarLoop]: Abstraction has 1346 states and 1816 transitions. [2022-07-21 09:56:58,250 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-21 09:56:58,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1816 transitions. [2022-07-21 09:56:58,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-21 09:56:58,252 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:56:58,252 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-21 09:56:58,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-21 09:56:58,473 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-21 09:56:58,474 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:56:58,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:56:58,474 INFO L85 PathProgramCache]: Analyzing trace with hash 193202081, now seen corresponding path program 1 times [2022-07-21 09:56:58,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:56:58,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45705716] [2022-07-21 09:56:58,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:56:58,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:56:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:58,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:56:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:58,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:56:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:58,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:56:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:58,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 09:56:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:58,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:56:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:58,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:56:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:58,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:56:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:58,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 09:56:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:58,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:56:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:58,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:56:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:58,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 09:56:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:58,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:56:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:58,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:56:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:58,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 09:56:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:58,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:56:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:58,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:56:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:58,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:56:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:58,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:56:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:58,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:56:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:58,739 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-21 09:56:58,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:56:58,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45705716] [2022-07-21 09:56:58,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45705716] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:56:58,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393631786] [2022-07-21 09:56:58,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:56:58,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:56:58,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:56:58,742 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-21 09:56:58,743 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-21 09:56:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 1889 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-21 09:56:59,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:56:59,217 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-21 09:56:59,217 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:56:59,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393631786] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:56:59,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:56:59,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2022-07-21 09:56:59,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485482756] [2022-07-21 09:56:59,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:56:59,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:56:59,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:56:59,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:56:59,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:56:59,218 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-21 09:56:59,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:56:59,313 INFO L93 Difference]: Finished difference Result 2703 states and 3651 transitions. [2022-07-21 09:56:59,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:56:59,314 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-21 09:56:59,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:56:59,319 INFO L225 Difference]: With dead ends: 2703 [2022-07-21 09:56:59,320 INFO L226 Difference]: Without dead ends: 1367 [2022-07-21 09:56:59,323 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-21 09:56:59,324 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-21 09:56:59,324 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-21 09:56:59,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2022-07-21 09:56:59,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1353. [2022-07-21 09:56:59,357 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-21 09:56:59,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1826 transitions. [2022-07-21 09:56:59,361 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1826 transitions. Word has length 147 [2022-07-21 09:56:59,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:56:59,361 INFO L495 AbstractCegarLoop]: Abstraction has 1353 states and 1826 transitions. [2022-07-21 09:56:59,361 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-21 09:56:59,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1826 transitions. [2022-07-21 09:56:59,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-21 09:56:59,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:56:59,365 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-21 09:56:59,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 09:56:59,579 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-21 09:56:59,580 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:56:59,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:56:59,580 INFO L85 PathProgramCache]: Analyzing trace with hash -2120603136, now seen corresponding path program 1 times [2022-07-21 09:56:59,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:56:59,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245027667] [2022-07-21 09:56:59,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:56:59,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:56:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:56:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:56:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:56:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 09:56:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:56:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:56:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:56:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 09:56:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:56:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:56:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 09:56:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:56:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:56:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 09:56:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:56:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:56:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:56:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:56:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:56:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:59,838 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-21 09:56:59,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:56:59,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245027667] [2022-07-21 09:56:59,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245027667] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:56:59,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977691549] [2022-07-21 09:56:59,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:56:59,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:56:59,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:56:59,840 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-21 09:56:59,841 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-21 09:57:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:00,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-21 09:57:00,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:00,343 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-21 09:57:00,346 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-21 09:57:00,461 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-21 09:57:00,461 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-21 09:57:00,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:00,467 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-21 09:57:00,602 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-21 09:57:00,603 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-21 09:57:00,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:00,609 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-21 09:57:00,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:00,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:00,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:00,865 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-21 09:57:00,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:00,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:00,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:00,877 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-21 09:57:00,906 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-21 09:57:00,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:57:01,139 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-21 09:57:01,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977691549] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:57:01,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:57:01,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 8] total 19 [2022-07-21 09:57:01,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140273596] [2022-07-21 09:57:01,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:57:01,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-21 09:57:01,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:01,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-21 09:57:01,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-07-21 09:57:01,141 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-21 09:57:04,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:04,830 INFO L93 Difference]: Finished difference Result 2464 states and 3330 transitions. [2022-07-21 09:57:04,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 09:57:04,831 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-21 09:57:04,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:04,835 INFO L225 Difference]: With dead ends: 2464 [2022-07-21 09:57:04,835 INFO L226 Difference]: Without dead ends: 1032 [2022-07-21 09:57:04,839 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-21 09:57:04,839 INFO L413 NwaCegarLoop]: 704 mSDtfsCounter, 170 mSDsluCounter, 3782 mSDsCounter, 0 mSdLazyCounter, 2473 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s 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-21 09:57:04,839 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-21 09:57:04,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2022-07-21 09:57:04,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1016. [2022-07-21 09:57:04,865 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-21 09:57:04,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1346 transitions. [2022-07-21 09:57:04,868 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1346 transitions. Word has length 147 [2022-07-21 09:57:04,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:04,869 INFO L495 AbstractCegarLoop]: Abstraction has 1016 states and 1346 transitions. [2022-07-21 09:57:04,869 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-21 09:57:04,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1346 transitions. [2022-07-21 09:57:04,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-21 09:57:04,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:04,871 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-21 09:57:04,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-21 09:57:05,087 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-21 09:57:05,087 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:05,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:05,088 INFO L85 PathProgramCache]: Analyzing trace with hash -339103201, now seen corresponding path program 1 times [2022-07-21 09:57:05,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:05,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624344234] [2022-07-21 09:57:05,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:05,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:05,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:05,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:57:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:05,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:57:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:05,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 09:57:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:05,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:57:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:05,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:57:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:05,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:57:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:05,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 09:57:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:05,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:05,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:05,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 09:57:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:05,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:05,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:05,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 09:57:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:05,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:05,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:05,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:57:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:05,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:05,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:05,346 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-21 09:57:05,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:05,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624344234] [2022-07-21 09:57:05,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624344234] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:05,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783401679] [2022-07-21 09:57:05,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:05,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:05,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:05,352 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-21 09:57:05,353 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-21 09:57:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:05,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 1897 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 09:57:05,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:06,013 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-21 09:57:06,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:57:06,286 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-21 09:57:06,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783401679] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:57:06,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:57:06,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 16 [2022-07-21 09:57:06,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097165332] [2022-07-21 09:57:06,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:57:06,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 09:57:06,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:06,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 09:57:06,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-07-21 09:57:06,289 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-21 09:57:11,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:11,672 INFO L93 Difference]: Finished difference Result 2099 states and 2804 transitions. [2022-07-21 09:57:11,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 09:57:11,673 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-21 09:57:11,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:11,684 INFO L225 Difference]: With dead ends: 2099 [2022-07-21 09:57:11,685 INFO L226 Difference]: Without dead ends: 1397 [2022-07-21 09:57:11,687 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-21 09:57:11,687 INFO L413 NwaCegarLoop]: 925 mSDtfsCounter, 2183 mSDsluCounter, 4045 mSDsCounter, 0 mSdLazyCounter, 4174 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2314 SdHoareTripleChecker+Valid, 4970 SdHoareTripleChecker+Invalid, 5274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 4174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:11,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2314 Valid, 4970 Invalid, 5274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 4174 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-21 09:57:11,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2022-07-21 09:57:11,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1372. [2022-07-21 09:57:11,723 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-21 09:57:11,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1823 transitions. [2022-07-21 09:57:11,727 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1823 transitions. Word has length 147 [2022-07-21 09:57:11,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:11,727 INFO L495 AbstractCegarLoop]: Abstraction has 1372 states and 1823 transitions. [2022-07-21 09:57:11,727 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-21 09:57:11,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1823 transitions. [2022-07-21 09:57:11,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-21 09:57:11,729 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:11,729 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-21 09:57:11,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 09:57:11,950 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-21 09:57:11,950 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:11,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:11,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1013490977, now seen corresponding path program 1 times [2022-07-21 09:57:11,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:11,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268819464] [2022-07-21 09:57:11,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:11,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:57:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:57:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 09:57:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:57:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:57:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:57:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 09:57:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 09:57:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 09:57:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:57:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 09:57:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,194 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-21 09:57:12,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:12,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268819464] [2022-07-21 09:57:12,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268819464] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:12,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511959398] [2022-07-21 09:57:12,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:12,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:12,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:12,196 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-21 09:57:12,219 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-21 09:57:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 1930 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-21 09:57:12,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:12,731 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-21 09:57:12,734 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-21 09:57:12,744 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-21 09:57:12,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:57:12,836 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-21 09:57:12,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511959398] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:12,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-21 09:57:12,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 12 [2022-07-21 09:57:12,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695604637] [2022-07-21 09:57:12,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:12,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:57:12,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:12,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:57:12,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-21 09:57:12,838 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-21 09:57:14,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:14,075 INFO L93 Difference]: Finished difference Result 1437 states and 1901 transitions. [2022-07-21 09:57:14,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:57:14,076 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-21 09:57:14,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:14,081 INFO L225 Difference]: With dead ends: 1437 [2022-07-21 09:57:14,081 INFO L226 Difference]: Without dead ends: 1372 [2022-07-21 09:57:14,082 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-21 09:57:14,082 INFO L413 NwaCegarLoop]: 698 mSDtfsCounter, 5 mSDsluCounter, 3225 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:14,082 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.2s Time] [2022-07-21 09:57:14,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2022-07-21 09:57:14,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1372. [2022-07-21 09:57:14,115 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-21 09:57:14,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1822 transitions. [2022-07-21 09:57:14,118 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1822 transitions. Word has length 157 [2022-07-21 09:57:14,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:14,118 INFO L495 AbstractCegarLoop]: Abstraction has 1372 states and 1822 transitions. [2022-07-21 09:57:14,118 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-21 09:57:14,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1822 transitions. [2022-07-21 09:57:14,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-21 09:57:14,119 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:14,120 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-21 09:57:14,145 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-21 09:57:14,326 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-21 09:57:14,327 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:14,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:14,327 INFO L85 PathProgramCache]: Analyzing trace with hash -497932717, now seen corresponding path program 1 times [2022-07-21 09:57:14,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:14,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477657012] [2022-07-21 09:57:14,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:14,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:57:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:57:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 09:57:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:57:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:57:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:57:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 09:57:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 09:57:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 09:57:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:57:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 09:57:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,585 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-21 09:57:14,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:14,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477657012] [2022-07-21 09:57:14,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477657012] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:14,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794359458] [2022-07-21 09:57:14,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:14,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:14,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:14,587 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-21 09:57:14,623 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-21 09:57:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:15,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 1935 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-21 09:57:15,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:15,097 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-21 09:57:15,100 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-21 09:57:15,178 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-21 09:57:15,178 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-21 09:57:15,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:15,182 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-21 09:57:15,297 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-21 09:57:15,297 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-21 09:57:15,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:15,303 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-21 09:57:15,371 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-21 09:57:15,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:57:15,563 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-21 09:57:15,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794359458] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:57:15,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:57:15,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 17 [2022-07-21 09:57:15,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854212536] [2022-07-21 09:57:15,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:57:15,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-21 09:57:15,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:15,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-21 09:57:15,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-07-21 09:57:15,566 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-21 09:57:18,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:18,928 INFO L93 Difference]: Finished difference Result 2452 states and 3275 transitions. [2022-07-21 09:57:18,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 09:57:18,928 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-21 09:57:18,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:18,937 INFO L225 Difference]: With dead ends: 2452 [2022-07-21 09:57:18,938 INFO L226 Difference]: Without dead ends: 1374 [2022-07-21 09:57:18,940 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-21 09:57:18,941 INFO L413 NwaCegarLoop]: 693 mSDtfsCounter, 173 mSDsluCounter, 3400 mSDsCounter, 0 mSdLazyCounter, 2517 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 4093 SdHoareTripleChecker+Invalid, 3067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 2517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 416 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:18,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 4093 Invalid, 3067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 2517 Invalid, 0 Unknown, 416 Unchecked, 3.2s Time] [2022-07-21 09:57:18,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2022-07-21 09:57:18,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1372. [2022-07-21 09:57:18,972 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-21 09:57:18,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1821 transitions. [2022-07-21 09:57:18,975 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1821 transitions. Word has length 158 [2022-07-21 09:57:18,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:18,975 INFO L495 AbstractCegarLoop]: Abstraction has 1372 states and 1821 transitions. [2022-07-21 09:57:18,976 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-21 09:57:18,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1821 transitions. [2022-07-21 09:57:18,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-21 09:57:18,977 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:18,977 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-21 09:57:18,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-21 09:57:19,191 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-21 09:57:19,193 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:19,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:19,194 INFO L85 PathProgramCache]: Analyzing trace with hash 865652627, now seen corresponding path program 1 times [2022-07-21 09:57:19,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:19,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336851147] [2022-07-21 09:57:19,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:19,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:57:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:57:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 09:57:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:57:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:57:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:57:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 09:57:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 09:57:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 09:57:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:57:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 09:57:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,446 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-21 09:57:19,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:19,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336851147] [2022-07-21 09:57:19,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336851147] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:19,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461904340] [2022-07-21 09:57:19,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:19,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:19,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:19,448 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-21 09:57:19,449 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-21 09:57:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 1961 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-21 09:57:19,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:20,117 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-21 09:57:20,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:57:20,440 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-21 09:57:20,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461904340] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:57:20,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:57:20,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 11] total 22 [2022-07-21 09:57:20,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97380655] [2022-07-21 09:57:20,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:57:20,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-21 09:57:20,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:20,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-21 09:57:20,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2022-07-21 09:57:20,442 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-21 09:57:26,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:26,306 INFO L93 Difference]: Finished difference Result 2837 states and 3755 transitions. [2022-07-21 09:57:26,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-21 09:57:26,307 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-21 09:57:26,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:26,313 INFO L225 Difference]: With dead ends: 2837 [2022-07-21 09:57:26,314 INFO L226 Difference]: Without dead ends: 1782 [2022-07-21 09:57:26,317 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-21 09:57:26,317 INFO L413 NwaCegarLoop]: 964 mSDtfsCounter, 2605 mSDsluCounter, 4877 mSDsCounter, 0 mSdLazyCounter, 5661 mSolverCounterSat, 1381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s 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.5s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:26,317 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.5s Time] [2022-07-21 09:57:26,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2022-07-21 09:57:26,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1735. [2022-07-21 09:57:26,364 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-21 09:57:26,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2287 transitions. [2022-07-21 09:57:26,370 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2287 transitions. Word has length 158 [2022-07-21 09:57:26,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:26,370 INFO L495 AbstractCegarLoop]: Abstraction has 1735 states and 2287 transitions. [2022-07-21 09:57:26,370 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-21 09:57:26,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2287 transitions. [2022-07-21 09:57:26,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-21 09:57:26,372 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:26,372 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-21 09:57:26,407 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-21 09:57:26,594 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-21 09:57:26,595 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:26,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:26,595 INFO L85 PathProgramCache]: Analyzing trace with hash -2103165584, now seen corresponding path program 1 times [2022-07-21 09:57:26,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:26,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693846618] [2022-07-21 09:57:26,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:26,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:57:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:57:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 09:57:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:57:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:57:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:57:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 09:57:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 09:57:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 09:57:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:57:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 09:57:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 09:57:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,828 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-21 09:57:26,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:26,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693846618] [2022-07-21 09:57:26,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693846618] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:26,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774450103] [2022-07-21 09:57:26,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:26,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:26,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:26,830 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-21 09:57:26,831 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-21 09:57:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:27,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 1967 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-21 09:57:27,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:27,455 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-21 09:57:27,458 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-21 09:57:27,470 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-21 09:57:27,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:57:27,594 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-21 09:57:27,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774450103] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:27,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-21 09:57:27,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 12 [2022-07-21 09:57:27,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091090049] [2022-07-21 09:57:27,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:27,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:57:27,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:27,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:57:27,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-21 09:57:27,597 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-21 09:57:28,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:28,534 INFO L93 Difference]: Finished difference Result 1822 states and 2390 transitions. [2022-07-21 09:57:28,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:57:28,534 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-21 09:57:28,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:28,541 INFO L225 Difference]: With dead ends: 1822 [2022-07-21 09:57:28,542 INFO L226 Difference]: Without dead ends: 1735 [2022-07-21 09:57:28,543 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-21 09:57:28,544 INFO L413 NwaCegarLoop]: 701 mSDtfsCounter, 6 mSDsluCounter, 3230 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:28,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3931 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 09:57:28,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-07-21 09:57:28,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1735. [2022-07-21 09:57:28,590 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-21 09:57:28,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2286 transitions. [2022-07-21 09:57:28,594 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2286 transitions. Word has length 168 [2022-07-21 09:57:28,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:28,594 INFO L495 AbstractCegarLoop]: Abstraction has 1735 states and 2286 transitions. [2022-07-21 09:57:28,595 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-21 09:57:28,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2286 transitions. [2022-07-21 09:57:28,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-21 09:57:28,596 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:28,597 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-21 09:57:28,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-21 09:57:28,819 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-21 09:57:28,819 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:28,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:28,820 INFO L85 PathProgramCache]: Analyzing trace with hash -332857001, now seen corresponding path program 1 times [2022-07-21 09:57:28,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:28,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121861258] [2022-07-21 09:57:28,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:28,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:57:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:57:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 09:57:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:57:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:57:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:57:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 09:57:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 09:57:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 09:57:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:57:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 09:57:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-21 09:57:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,066 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-21 09:57:29,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:29,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121861258] [2022-07-21 09:57:29,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121861258] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:29,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957096115] [2022-07-21 09:57:29,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:29,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:29,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:29,068 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-21 09:57:29,099 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-21 09:57:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 1972 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-21 09:57:29,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:29,590 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-21 09:57:29,593 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-21 09:57:29,762 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-21 09:57:29,764 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-21 09:57:29,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:29,772 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-21 09:57:30,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:30,121 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-21 09:57:30,134 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-21 09:57:30,134 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-21 09:57:30,173 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-21 09:57:30,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:57:30,318 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-21 09:57:30,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957096115] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:57:30,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:57:30,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 8] total 17 [2022-07-21 09:57:30,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220802330] [2022-07-21 09:57:30,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:57:30,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-21 09:57:30,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:30,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-21 09:57:30,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-07-21 09:57:30,320 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-21 09:57:32,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:32,647 INFO L93 Difference]: Finished difference Result 3174 states and 4193 transitions. [2022-07-21 09:57:32,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 09:57:32,648 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-21 09:57:32,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:32,654 INFO L225 Difference]: With dead ends: 3174 [2022-07-21 09:57:32,654 INFO L226 Difference]: Without dead ends: 1735 [2022-07-21 09:57:32,658 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-21 09:57:32,658 INFO L413 NwaCegarLoop]: 690 mSDtfsCounter, 177 mSDsluCounter, 4029 mSDsCounter, 0 mSdLazyCounter, 2225 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 4719 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-21 09:57:32,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 4719 Invalid, 3152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 2225 Invalid, 0 Unknown, 795 Unchecked, 2.2s Time] [2022-07-21 09:57:32,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-07-21 09:57:32,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1735. [2022-07-21 09:57:32,698 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-21 09:57:32,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2285 transitions. [2022-07-21 09:57:32,715 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2285 transitions. Word has length 169 [2022-07-21 09:57:32,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:32,716 INFO L495 AbstractCegarLoop]: Abstraction has 1735 states and 2285 transitions. [2022-07-21 09:57:32,716 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-21 09:57:32,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2285 transitions. [2022-07-21 09:57:32,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-21 09:57:32,718 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:32,718 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-21 09:57:32,749 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-21 09:57:32,929 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-21 09:57:32,930 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:32,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:32,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1756471977, now seen corresponding path program 1 times [2022-07-21 09:57:32,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:32,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802424440] [2022-07-21 09:57:32,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:32,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:57:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:57:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 09:57:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:57:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:57:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:57:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 09:57:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 09:57:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 09:57:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:57:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 09:57:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-21 09:57:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,216 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-21 09:57:33,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:33,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802424440] [2022-07-21 09:57:33,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802424440] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:33,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:33,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-21 09:57:33,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87119568] [2022-07-21 09:57:33,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:33,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 09:57:33,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:33,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 09:57:33,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-21 09:57:33,219 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-21 09:57:37,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:37,273 INFO L93 Difference]: Finished difference Result 1826 states and 2397 transitions. [2022-07-21 09:57:37,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 09:57:37,273 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-21 09:57:37,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:37,279 INFO L225 Difference]: With dead ends: 1826 [2022-07-21 09:57:37,279 INFO L226 Difference]: Without dead ends: 1748 [2022-07-21 09:57:37,280 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-21 09:57:37,281 INFO L413 NwaCegarLoop]: 674 mSDtfsCounter, 502 mSDsluCounter, 4055 mSDsCounter, 0 mSdLazyCounter, 3157 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s 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.9s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:37,281 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.9s Time] [2022-07-21 09:57:37,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2022-07-21 09:57:37,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1740. [2022-07-21 09:57:37,320 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-21 09:57:37,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 2290 transitions. [2022-07-21 09:57:37,324 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 2290 transitions. Word has length 169 [2022-07-21 09:57:37,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:37,324 INFO L495 AbstractCegarLoop]: Abstraction has 1740 states and 2290 transitions. [2022-07-21 09:57:37,325 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-21 09:57:37,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2290 transitions. [2022-07-21 09:57:37,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-21 09:57:37,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:37,327 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-21 09:57:37,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 09:57:37,328 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:37,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:37,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1061543817, now seen corresponding path program 2 times [2022-07-21 09:57:37,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:37,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979837393] [2022-07-21 09:57:37,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:37,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:57:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:57:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 09:57:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:57:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:57:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:57:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 09:57:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 09:57:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 09:57:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:57:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 09:57:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-21 09:57:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:37,612 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-21 09:57:37,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:37,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979837393] [2022-07-21 09:57:37,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979837393] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:37,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736522317] [2022-07-21 09:57:37,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 09:57:37,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:37,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:37,614 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-21 09:57:37,615 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-21 09:57:38,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 09:57:38,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 09:57:38,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 1980 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-21 09:57:38,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:38,319 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-21 09:57:38,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:57:38,669 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-21 09:57:38,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736522317] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:57:38,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:57:38,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 15] total 24 [2022-07-21 09:57:38,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406488843] [2022-07-21 09:57:38,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:57:38,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-21 09:57:38,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:38,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-21 09:57:38,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2022-07-21 09:57:38,671 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-21 09:57:43,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:43,673 INFO L93 Difference]: Finished difference Result 2197 states and 2842 transitions. [2022-07-21 09:57:43,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-21 09:57:43,673 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-21 09:57:43,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:43,681 INFO L225 Difference]: With dead ends: 2197 [2022-07-21 09:57:43,681 INFO L226 Difference]: Without dead ends: 2185 [2022-07-21 09:57:43,682 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-21 09:57:43,682 INFO L413 NwaCegarLoop]: 990 mSDtfsCounter, 6428 mSDsluCounter, 3541 mSDsCounter, 0 mSdLazyCounter, 4921 mSolverCounterSat, 2976 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s 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-21 09:57:43,682 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-21 09:57:43,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2022-07-21 09:57:43,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 2105. [2022-07-21 09:57:43,734 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-21 09:57:43,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 2753 transitions. [2022-07-21 09:57:43,738 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 2753 transitions. Word has length 169 [2022-07-21 09:57:43,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:43,739 INFO L495 AbstractCegarLoop]: Abstraction has 2105 states and 2753 transitions. [2022-07-21 09:57:43,739 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-21 09:57:43,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 2753 transitions. [2022-07-21 09:57:43,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-07-21 09:57:43,740 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:43,741 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-21 09:57:43,763 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-21 09:57:43,963 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-21 09:57:43,963 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:43,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:43,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1170991758, now seen corresponding path program 1 times [2022-07-21 09:57:43,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:43,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030209637] [2022-07-21 09:57:43,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:43,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:57:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:57:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 09:57:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:57:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:57:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:57:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 09:57:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 09:57:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 09:57:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:57:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 09:57:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-21 09:57:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-21 09:57:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,232 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-21 09:57:44,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:44,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030209637] [2022-07-21 09:57:44,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030209637] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:44,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403381461] [2022-07-21 09:57:44,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:44,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:44,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:44,234 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-21 09:57:44,235 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-21 09:57:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:44,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 2004 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-21 09:57:44,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:44,942 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-21 09:57:44,944 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-21 09:57:44,955 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-21 09:57:44,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:57:45,055 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-21 09:57:45,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403381461] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:45,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-21 09:57:45,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 12 [2022-07-21 09:57:45,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319478247] [2022-07-21 09:57:45,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:45,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:57:45,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:45,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:57:45,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-21 09:57:45,057 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-21 09:57:45,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:45,981 INFO L93 Difference]: Finished difference Result 2171 states and 2812 transitions. [2022-07-21 09:57:45,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:57:45,981 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-21 09:57:45,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:45,988 INFO L225 Difference]: With dead ends: 2171 [2022-07-21 09:57:45,988 INFO L226 Difference]: Without dead ends: 2076 [2022-07-21 09:57:45,988 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-21 09:57:45,989 INFO L413 NwaCegarLoop]: 688 mSDtfsCounter, 7 mSDsluCounter, 3170 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:45,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3858 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 09:57:45,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2022-07-21 09:57:46,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 2071. [2022-07-21 09:57:46,040 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-21 09:57:46,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 2694 transitions. [2022-07-21 09:57:46,044 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 2694 transitions. Word has length 179 [2022-07-21 09:57:46,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:46,045 INFO L495 AbstractCegarLoop]: Abstraction has 2071 states and 2694 transitions. [2022-07-21 09:57:46,045 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-21 09:57:46,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 2694 transitions. [2022-07-21 09:57:46,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-07-21 09:57:46,047 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:46,048 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-21 09:57:46,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-21 09:57:46,268 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-21 09:57:46,269 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:46,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:46,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1646245098, now seen corresponding path program 1 times [2022-07-21 09:57:46,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:46,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927402655] [2022-07-21 09:57:46,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:46,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:57:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:57:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 09:57:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:57:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:57:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:57:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 09:57:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 09:57:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 09:57:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:57:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 09:57:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 09:57:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-21 09:57:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 09:57:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-21 09:57:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-21 09:57:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 09:57:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-21 09:57:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-21 09:57:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-21 09:57:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-21 09:57:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-21 09:57:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:46,626 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-21 09:57:46,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:46,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927402655] [2022-07-21 09:57:46,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927402655] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:46,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:46,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 09:57:46,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225518339] [2022-07-21 09:57:46,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:46,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 09:57:46,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:46,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 09:57:46,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:57:46,628 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-21 09:57:49,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:49,597 INFO L93 Difference]: Finished difference Result 3867 states and 5086 transitions. [2022-07-21 09:57:49,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 09:57:49,598 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-21 09:57:49,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:49,605 INFO L225 Difference]: With dead ends: 3867 [2022-07-21 09:57:49,605 INFO L226 Difference]: Without dead ends: 2110 [2022-07-21 09:57:49,609 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-21 09:57:49,610 INFO L413 NwaCegarLoop]: 662 mSDtfsCounter, 465 mSDsluCounter, 2453 mSDsCounter, 0 mSdLazyCounter, 2091 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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, 2.8s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:49,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 3115 Invalid, 2505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 2091 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-21 09:57:49,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2110 states. [2022-07-21 09:57:49,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 2064. [2022-07-21 09:57:49,671 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-21 09:57:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2686 transitions. [2022-07-21 09:57:49,707 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2686 transitions. Word has length 263 [2022-07-21 09:57:49,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:49,708 INFO L495 AbstractCegarLoop]: Abstraction has 2064 states and 2686 transitions. [2022-07-21 09:57:49,708 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-21 09:57:49,708 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2686 transitions. [2022-07-21 09:57:49,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-07-21 09:57:49,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:49,710 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-21 09:57:49,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 09:57:49,710 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:49,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:49,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1841616438, now seen corresponding path program 1 times [2022-07-21 09:57:49,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:49,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676510010] [2022-07-21 09:57:49,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:49,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:57:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:57:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 09:57:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:57:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:57:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:57:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 09:57:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 09:57:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 09:57:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:57:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 09:57:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 09:57:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-21 09:57:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 09:57:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-21 09:57:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-21 09:57:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 09:57:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-21 09:57:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-21 09:57:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-21 09:57:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-21 09:57:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-21 09:57:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:49,967 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-21 09:57:49,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:49,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676510010] [2022-07-21 09:57:49,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676510010] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:49,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:49,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 09:57:49,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213322687] [2022-07-21 09:57:49,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:49,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 09:57:49,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:49,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 09:57:49,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:57:49,970 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-21 09:57:52,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:52,052 INFO L93 Difference]: Finished difference Result 2130 states and 2809 transitions. [2022-07-21 09:57:52,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 09:57:52,052 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-21 09:57:52,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:52,059 INFO L225 Difference]: With dead ends: 2130 [2022-07-21 09:57:52,060 INFO L226 Difference]: Without dead ends: 2120 [2022-07-21 09:57:52,061 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-21 09:57:52,061 INFO L413 NwaCegarLoop]: 833 mSDtfsCounter, 1346 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 731 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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-21 09:57:52,061 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-21 09:57:52,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2022-07-21 09:57:52,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 2064. [2022-07-21 09:57:52,154 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-21 09:57:52,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2685 transitions. [2022-07-21 09:57:52,158 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2685 transitions. Word has length 263 [2022-07-21 09:57:52,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:52,159 INFO L495 AbstractCegarLoop]: Abstraction has 2064 states and 2685 transitions. [2022-07-21 09:57:52,159 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-21 09:57:52,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2685 transitions. [2022-07-21 09:57:52,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-07-21 09:57:52,161 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:52,161 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-21 09:57:52,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 09:57:52,162 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:52,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:52,162 INFO L85 PathProgramCache]: Analyzing trace with hash 810198159, now seen corresponding path program 1 times [2022-07-21 09:57:52,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:52,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967400125] [2022-07-21 09:57:52,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:52,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:57:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:57:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 09:57:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:57:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:57:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:57:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 09:57:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 09:57:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 09:57:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:57:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 09:57:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 09:57:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-21 09:57:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 09:57:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-21 09:57:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-21 09:57:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 09:57:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-21 09:57:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-21 09:57:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-21 09:57:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-21 09:57:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-07-21 09:57:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:52,486 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-21 09:57:52,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:52,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967400125] [2022-07-21 09:57:52,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967400125] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:52,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484438134] [2022-07-21 09:57:52,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:52,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:52,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:52,488 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-21 09:57:52,489 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-21 09:57:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:53,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 3081 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 09:57:53,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:53,300 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-21 09:57:53,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:57:53,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484438134] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:53,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:57:53,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-21 09:57:53,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969499430] [2022-07-21 09:57:53,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:53,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:57:53,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:53,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:57:53,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-21 09:57:53,303 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-21 09:57:53,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:53,543 INFO L93 Difference]: Finished difference Result 3806 states and 4963 transitions. [2022-07-21 09:57:53,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 09:57:53,543 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-21 09:57:53,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:53,558 INFO L225 Difference]: With dead ends: 3806 [2022-07-21 09:57:53,559 INFO L226 Difference]: Without dead ends: 2068 [2022-07-21 09:57:53,562 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-21 09:57:53,563 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-21 09:57:53,563 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-21 09:57:53,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2022-07-21 09:57:53,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 2064. [2022-07-21 09:57:53,619 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-21 09:57:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2683 transitions. [2022-07-21 09:57:53,625 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2683 transitions. Word has length 268 [2022-07-21 09:57:53,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:53,626 INFO L495 AbstractCegarLoop]: Abstraction has 2064 states and 2683 transitions. [2022-07-21 09:57:53,626 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-21 09:57:53,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2683 transitions. [2022-07-21 09:57:53,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2022-07-21 09:57:53,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:53,629 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-21 09:57:53,654 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-21 09:57:53,843 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-21 09:57:53,844 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:53,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:53,844 INFO L85 PathProgramCache]: Analyzing trace with hash 589418021, now seen corresponding path program 1 times [2022-07-21 09:57:53,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:53,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981289601] [2022-07-21 09:57:53,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:53,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:53,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:53,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 09:57:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:53,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:57:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:53,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 09:57:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:53,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:57:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:53,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:57:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:53,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:57:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 09:57:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 09:57:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 09:57:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:57:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 09:57:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 09:57:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-21 09:57:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 09:57:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-21 09:57:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-21 09:57:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 09:57:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-21 09:57:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-21 09:57:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-21 09:57:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-21 09:57:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-21 09:57:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-07-21 09:57:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-21 09:57:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-07-21 09:57:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,116 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-21 09:57:54,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:54,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981289601] [2022-07-21 09:57:54,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981289601] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:54,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137649830] [2022-07-21 09:57:54,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:54,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:54,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:54,128 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-21 09:57:54,129 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-21 09:57:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:54,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 3178 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 09:57:54,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:55,051 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-21 09:57:55,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:57:55,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137649830] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:55,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:57:55,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-07-21 09:57:55,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926033971] [2022-07-21 09:57:55,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:55,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:57:55,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:55,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:57:55,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:57:55,053 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-21 09:57:55,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:55,179 INFO L93 Difference]: Finished difference Result 3810 states and 4981 transitions. [2022-07-21 09:57:55,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:57:55,179 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-21 09:57:55,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:55,185 INFO L225 Difference]: With dead ends: 3810 [2022-07-21 09:57:55,185 INFO L226 Difference]: Without dead ends: 2072 [2022-07-21 09:57:55,188 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-21 09:57:55,189 INFO L413 NwaCegarLoop]: 659 mSDtfsCounter, 30 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-21 09:57:55,189 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-21 09:57:55,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2022-07-21 09:57:55,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 2072. [2022-07-21 09:57:55,247 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-21 09:57:55,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 2691 transitions. [2022-07-21 09:57:55,251 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 2691 transitions. Word has length 288 [2022-07-21 09:57:55,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:55,251 INFO L495 AbstractCegarLoop]: Abstraction has 2072 states and 2691 transitions. [2022-07-21 09:57:55,252 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-21 09:57:55,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2691 transitions. [2022-07-21 09:57:55,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2022-07-21 09:57:55,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:55,254 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-21 09:57:55,283 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-21 09:57:55,463 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-21 09:57:55,463 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:55,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:55,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1005655303, now seen corresponding path program 1 times [2022-07-21 09:57:55,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:55,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397035644] [2022-07-21 09:57:55,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:55,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 09:57:56,692 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 09:57:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 09:57:59,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 09:57:59,341 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 09:57:59,342 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 09:57:59,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-21 09:57:59,345 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-21 09:57:59,349 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 09:57:59,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 09:57:59 BoogieIcfgContainer [2022-07-21 09:57:59,539 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 09:57:59,539 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 09:57:59,539 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 09:57:59,539 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 09:57:59,540 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:56:52" (3/4) ... [2022-07-21 09:57:59,541 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-21 09:57:59,541 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 09:57:59,542 INFO L158 Benchmark]: Toolchain (without parser) took 70532.65ms. Allocated memory was 56.6MB in the beginning and 828.4MB in the end (delta: 771.8MB). Free memory was 26.5MB in the beginning and 495.6MB in the end (delta: -469.2MB). Peak memory consumption was 302.8MB. Max. memory is 16.1GB. [2022-07-21 09:57:59,542 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 56.6MB. Free memory was 38.8MB in the beginning and 38.7MB in the end (delta: 51.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 09:57:59,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1458.03ms. Allocated memory was 56.6MB in the beginning and 144.7MB in the end (delta: 88.1MB). Free memory was 26.3MB in the beginning and 90.9MB in the end (delta: -64.5MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. [2022-07-21 09:57:59,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 125.98ms. Allocated memory is still 144.7MB. Free memory was 90.9MB in the beginning and 78.6MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 09:57:59,543 INFO L158 Benchmark]: Boogie Preprocessor took 120.20ms. Allocated memory is still 144.7MB. Free memory was 78.6MB in the beginning and 66.9MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 09:57:59,543 INFO L158 Benchmark]: RCFGBuilder took 1852.63ms. Allocated memory was 144.7MB in the beginning and 243.3MB in the end (delta: 98.6MB). Free memory was 66.9MB in the beginning and 114.5MB in the end (delta: -47.6MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. [2022-07-21 09:57:59,543 INFO L158 Benchmark]: TraceAbstraction took 66968.12ms. Allocated memory was 243.3MB in the beginning and 828.4MB in the end (delta: 585.1MB). Free memory was 114.5MB in the beginning and 495.6MB in the end (delta: -381.1MB). Peak memory consumption was 432.6MB. Max. memory is 16.1GB. [2022-07-21 09:57:59,543 INFO L158 Benchmark]: Witness Printer took 2.55ms. Allocated memory is still 828.4MB. Free memory is still 495.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 09:57:59,544 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 56.6MB. Free memory was 38.8MB in the beginning and 38.7MB in the end (delta: 51.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1458.03ms. Allocated memory was 56.6MB in the beginning and 144.7MB in the end (delta: 88.1MB). Free memory was 26.3MB in the beginning and 90.9MB in the end (delta: -64.5MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 125.98ms. Allocated memory is still 144.7MB. Free memory was 90.9MB in the beginning and 78.6MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 120.20ms. Allocated memory is still 144.7MB. Free memory was 78.6MB in the beginning and 66.9MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1852.63ms. Allocated memory was 144.7MB in the beginning and 243.3MB in the end (delta: 98.6MB). Free memory was 66.9MB in the beginning and 114.5MB in the end (delta: -47.6MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. * TraceAbstraction took 66968.12ms. Allocated memory was 243.3MB in the beginning and 828.4MB in the end (delta: 585.1MB). Free memory was 114.5MB in the beginning and 495.6MB in the end (delta: -381.1MB). Peak memory consumption was 432.6MB. Max. memory is 16.1GB. * Witness Printer took 2.55ms. Allocated memory is still 828.4MB. Free memory is still 495.6MB. 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.7s, OverallIterations: 22, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 42.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17886 SdHoareTripleChecker+Valid, 38.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16786 mSDsluCounter, 70177 SdHoareTripleChecker+Invalid, 35.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1633 IncrementalHoareTripleChecker+Unchecked, 54134 mSDsCounter, 7802 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30838 IncrementalHoareTripleChecker+Invalid, 40273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7802 mSolverCounterUnsat, 16043 mSDtfsCounter, 30838 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.6s 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.9s 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-21 09:57:59,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.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-?-3598765 [2022-07-21 09:58:01,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 09:58:01,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 09:58:01,273 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 09:58:01,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 09:58:01,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 09:58:01,282 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 09:58:01,285 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 09:58:01,286 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 09:58:01,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 09:58:01,290 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 09:58:01,292 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 09:58:01,292 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 09:58:01,294 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 09:58:01,295 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 09:58:01,298 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 09:58:01,298 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 09:58:01,300 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 09:58:01,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 09:58:01,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 09:58:01,307 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 09:58:01,308 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 09:58:01,309 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 09:58:01,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 09:58:01,310 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 09:58:01,313 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 09:58:01,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 09:58:01,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 09:58:01,315 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 09:58:01,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 09:58:01,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 09:58:01,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 09:58:01,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 09:58:01,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 09:58:01,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 09:58:01,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 09:58:01,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 09:58:01,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 09:58:01,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 09:58:01,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 09:58:01,320 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 09:58:01,321 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 09:58:01,322 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-21 09:58:01,356 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 09:58:01,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 09:58:01,357 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 09:58:01,358 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 09:58:01,358 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 09:58:01,358 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 09:58:01,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 09:58:01,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 09:58:01,359 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 09:58:01,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 09:58:01,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 09:58:01,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 09:58:01,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 09:58:01,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 09:58:01,361 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 09:58:01,361 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 09:58:01,361 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 09:58:01,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 09:58:01,361 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 09:58:01,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 09:58:01,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 09:58:01,362 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 09:58:01,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 09:58:01,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:58:01,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 09:58:01,363 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 09:58:01,363 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 09:58:01,363 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 09:58:01,363 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 09:58:01,363 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 09:58:01,364 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 09:58:01,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 09:58:01,364 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 09:58:01,364 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-21 09:58:01,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 09:58:01,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 09:58:01,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 09:58:01,610 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 09:58:01,611 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 09:58:01,612 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-21 09:58:01,662 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5baad3653/8ba7c60929ad471589820e6a56e9bc35/FLAG03cf927b0 [2022-07-21 09:58:02,290 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 09:58:02,291 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-21 09:58:02,323 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5baad3653/8ba7c60929ad471589820e6a56e9bc35/FLAG03cf927b0 [2022-07-21 09:58:02,495 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5baad3653/8ba7c60929ad471589820e6a56e9bc35 [2022-07-21 09:58:02,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 09:58:02,498 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 09:58:02,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 09:58:02,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 09:58:02,503 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 09:58:02,504 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:58:02" (1/1) ... [2022-07-21 09:58:02,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71e8715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:58:02, skipping insertion in model container [2022-07-21 09:58:02,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:58:02" (1/1) ... [2022-07-21 09:58:02,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 09:58:02,580 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 09:58:03,361 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-21 09:58:03,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:58:03,434 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-21 09:58:03,465 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 09:58:03,614 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-21 09:58:03,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:58:03,639 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 09:58:03,779 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-21 09:58:03,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:58:04,070 INFO L208 MainTranslator]: Completed translation [2022-07-21 09:58:04,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:58:04 WrapperNode [2022-07-21 09:58:04,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 09:58:04,072 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 09:58:04,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 09:58:04,072 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 09:58:04,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:58:04" (1/1) ... [2022-07-21 09:58:04,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:58:04" (1/1) ... [2022-07-21 09:58:04,176 INFO L137 Inliner]: procedures = 157, calls = 839, calls flagged for inlining = 59, calls inlined = 40, statements flattened = 1605 [2022-07-21 09:58:04,181 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 09:58:04,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 09:58:04,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 09:58:04,182 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 09:58:04,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:58:04" (1/1) ... [2022-07-21 09:58:04,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:58:04" (1/1) ... [2022-07-21 09:58:04,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:58:04" (1/1) ... [2022-07-21 09:58:04,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:58:04" (1/1) ... [2022-07-21 09:58:04,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:58:04" (1/1) ... [2022-07-21 09:58:04,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:58:04" (1/1) ... [2022-07-21 09:58:04,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:58:04" (1/1) ... [2022-07-21 09:58:04,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 09:58:04,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 09:58:04,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 09:58:04,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 09:58:04,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:58:04" (1/1) ... [2022-07-21 09:58:04,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:58:04,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:58:04,336 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-21 09:58:04,342 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-21 09:58:04,364 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-21 09:58:04,364 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-21 09:58:04,364 INFO L130 BoogieDeclarations]: Found specification of procedure catc_tx_run [2022-07-21 09:58:04,365 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_tx_run [2022-07-21 09:58:04,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-21 09:58:04,365 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-21 09:58:04,365 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-21 09:58:04,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-07-21 09:58:04,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 09:58:04,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-21 09:58:04,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2022-07-21 09:58:04,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-21 09:58:04,366 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-21 09:58:04,366 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-21 09:58:04,366 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-21 09:58:04,366 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-21 09:58:04,366 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_run [2022-07-21 09:58:04,366 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_run [2022-07-21 09:58:04,366 INFO L130 BoogieDeclarations]: Found specification of procedure catc_get_drvinfo [2022-07-21 09:58:04,366 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_get_drvinfo [2022-07-21 09:58:04,367 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_msg [2022-07-21 09:58:04,367 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_msg [2022-07-21 09:58:04,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-21 09:58:04,367 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-21 09:58:04,367 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-21 09:58:04,367 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-21 09:58:04,367 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 09:58:04,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 09:58:04,368 INFO L130 BoogieDeclarations]: Found specification of procedure catc_multicast [2022-07-21 09:58:04,368 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_multicast [2022-07-21 09:58:04,368 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-21 09:58:04,368 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-21 09:58:04,368 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-21 09:58:04,368 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-21 09:58:04,368 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-07-21 09:58:04,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-07-21 09:58:04,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2022-07-21 09:58:04,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2022-07-21 09:58:04,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2022-07-21 09:58:04,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2022-07-21 09:58:04,369 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-21 09:58:04,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-21 09:58:04,370 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-21 09:58:04,370 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-21 09:58:04,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-21 09:58:04,370 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-21 09:58:04,370 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-21 09:58:04,370 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-21 09:58:04,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 09:58:04,371 INFO L130 BoogieDeclarations]: Found specification of procedure crc32_le [2022-07-21 09:58:04,372 INFO L138 BoogieDeclarations]: Found implementation of procedure crc32_le [2022-07-21 09:58:04,372 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-21 09:58:04,372 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-21 09:58:04,373 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-21 09:58:04,373 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-21 09:58:04,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 09:58:04,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 09:58:04,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 09:58:04,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2022-07-21 09:58:04,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2022-07-21 09:58:04,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2022-07-21 09:58:04,374 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_async [2022-07-21 09:58:04,374 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_async [2022-07-21 09:58:04,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 09:58:04,374 INFO L130 BoogieDeclarations]: Found specification of procedure catc_exit [2022-07-21 09:58:04,374 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_exit [2022-07-21 09:58:04,375 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-21 09:58:04,375 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-21 09:58:04,375 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-21 09:58:04,375 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-21 09:58:04,375 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-21 09:58:04,376 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-21 09:58:04,376 INFO L130 BoogieDeclarations]: Found specification of procedure catc_init [2022-07-21 09:58:04,376 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_init [2022-07-21 09:58:04,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-07-21 09:58:04,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-21 09:58:04,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-07-21 09:58:04,376 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-21 09:58:04,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-21 09:58:04,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 09:58:04,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 09:58:04,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 09:58:04,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2022-07-21 09:58:04,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 09:58:04,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-07-21 09:58:04,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-07-21 09:58:04,378 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-21 09:58:04,378 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-21 09:58:04,378 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-07-21 09:58:04,378 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-07-21 09:58:04,379 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-21 09:58:04,379 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-21 09:58:04,379 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-21 09:58:04,379 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-21 09:58:04,380 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-21 09:58:04,380 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-21 09:58:04,380 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-07-21 09:58:04,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-07-21 09:58:04,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2022-07-21 09:58:04,380 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-21 09:58:04,380 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-21 09:58:04,381 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-07-21 09:58:04,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 09:58:04,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 09:58:04,728 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 09:58:04,729 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 09:58:15,134 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-07-21 09:58:15,228 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 09:58:15,235 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 09:58:25,498 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2022-07-21 09:58:25,498 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2022-07-21 09:58:25,498 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-07-21 09:58:25,499 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-07-21 09:58:25,530 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 09:58:25,542 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 09:58:25,542 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-07-21 09:58:25,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:58:25 BoogieIcfgContainer [2022-07-21 09:58:25,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 09:58:25,547 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 09:58:25,547 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 09:58:25,549 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 09:58:25,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 09:58:02" (1/3) ... [2022-07-21 09:58:25,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56add279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:58:25, skipping insertion in model container [2022-07-21 09:58:25,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:58:04" (2/3) ... [2022-07-21 09:58:25,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56add279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:58:25, skipping insertion in model container [2022-07-21 09:58:25,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:58:25" (3/3) ... [2022-07-21 09:58:25,554 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-07-21 09:58:25,562 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 09:58:25,563 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 09:58:25,616 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 09:58:25,621 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@10f145b1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@69a203c4 [2022-07-21 09:58:25,622 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 09:58:25,625 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-21 09:58:25,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 09:58:25,632 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:58:25,633 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:58:25,633 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:58:25,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:58:25,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1343427639, now seen corresponding path program 1 times [2022-07-21 09:58:25,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:58:25,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825723397] [2022-07-21 09:58:25,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:58:25,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:58:25,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:58:25,650 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-21 09:58:25,654 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-21 09:58:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:58:26,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 09:58:26,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:58:26,256 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-21 09:58:26,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:58:26,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:58:26,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825723397] [2022-07-21 09:58:26,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825723397] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:58:26,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:58:26,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 09:58:26,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709714074] [2022-07-21 09:58:26,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:58:26,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:58:26,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:58:26,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:58:26,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:58:26,291 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-21 09:58:26,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:58:26,469 INFO L93 Difference]: Finished difference Result 1076 states and 1560 transitions. [2022-07-21 09:58:26,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 09:58:26,471 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-21 09:58:26,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:58:26,481 INFO L225 Difference]: With dead ends: 1076 [2022-07-21 09:58:26,481 INFO L226 Difference]: Without dead ends: 540 [2022-07-21 09:58:26,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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-21 09:58:26,489 INFO L413 NwaCegarLoop]: 709 mSDtfsCounter, 301 mSDsluCounter, 2431 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:58:26,489 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.0s Time] [2022-07-21 09:58:26,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-07-21 09:58:26,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 535. [2022-07-21 09:58:26,559 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-21 09:58:26,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 700 transitions. [2022-07-21 09:58:26,563 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 700 transitions. Word has length 17 [2022-07-21 09:58:26,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:58:26,568 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 700 transitions. [2022-07-21 09:58:26,568 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-21 09:58:26,568 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 700 transitions. [2022-07-21 09:58:26,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 09:58:26,569 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:58:26,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:58:26,588 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-21 09:58:26,779 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-21 09:58:26,780 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:58:26,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:58:26,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1736454649, now seen corresponding path program 1 times [2022-07-21 09:58:26,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:58:26,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712039082] [2022-07-21 09:58:26,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:58:26,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:58:26,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:58:26,782 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-21 09:58:26,784 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-21 09:58:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:58:27,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 09:58:27,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:58:27,288 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-21 09:58:27,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:58:27,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:58:27,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712039082] [2022-07-21 09:58:27,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [712039082] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:58:27,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:58:27,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 09:58:27,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966054926] [2022-07-21 09:58:27,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:58:27,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:58:27,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:58:27,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:58:27,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 09:58:27,290 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-21 09:58:27,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:58:27,367 INFO L93 Difference]: Finished difference Result 1565 states and 2072 transitions. [2022-07-21 09:58:27,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:58:27,368 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-21 09:58:27,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:58:27,381 INFO L225 Difference]: With dead ends: 1565 [2022-07-21 09:58:27,381 INFO L226 Difference]: Without dead ends: 1048 [2022-07-21 09:58:27,384 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-21 09:58:27,385 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-21 09:58:27,387 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-21 09:58:27,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2022-07-21 09:58:27,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1045. [2022-07-21 09:58:27,433 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-21 09:58:27,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1376 transitions. [2022-07-21 09:58:27,438 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1376 transitions. Word has length 17 [2022-07-21 09:58:27,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:58:27,438 INFO L495 AbstractCegarLoop]: Abstraction has 1045 states and 1376 transitions. [2022-07-21 09:58:27,438 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-21 09:58:27,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1376 transitions. [2022-07-21 09:58:27,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 09:58:27,439 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:58:27,439 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-21 09:58:27,459 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-21 09:58:27,653 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-21 09:58:27,654 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:58:27,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:58:27,654 INFO L85 PathProgramCache]: Analyzing trace with hash 2004221234, now seen corresponding path program 1 times [2022-07-21 09:58:27,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:58:27,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680230763] [2022-07-21 09:58:27,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:58:27,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:58:27,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:58:27,656 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-21 09:58:27,658 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-21 09:58:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:58:28,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 09:58:28,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:58:28,170 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-21 09:58:28,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:58:28,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:58:28,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680230763] [2022-07-21 09:58:28,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680230763] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:58:28,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:58:28,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 09:58:28,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985213634] [2022-07-21 09:58:28,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:58:28,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:58:28,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:58:28,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:58:28,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 09:58:28,172 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-21 09:58:28,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:58:28,190 INFO L93 Difference]: Finished difference Result 1047 states and 1377 transitions. [2022-07-21 09:58:28,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:58:28,190 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-21 09:58:28,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:58:28,194 INFO L225 Difference]: With dead ends: 1047 [2022-07-21 09:58:28,194 INFO L226 Difference]: Without dead ends: 1036 [2022-07-21 09:58:28,194 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-21 09:58:28,195 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-21 09:58:28,195 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-21 09:58:28,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2022-07-21 09:58:28,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1031. [2022-07-21 09:58:28,219 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-21 09:58:28,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1356 transitions. [2022-07-21 09:58:28,223 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1356 transitions. Word has length 18 [2022-07-21 09:58:28,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:58:28,223 INFO L495 AbstractCegarLoop]: Abstraction has 1031 states and 1356 transitions. [2022-07-21 09:58:28,223 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-21 09:58:28,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1356 transitions. [2022-07-21 09:58:28,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-21 09:58:28,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:58:28,226 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-21 09:58:28,257 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-21 09:58:28,443 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-21 09:58:28,444 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:58:28,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:58:28,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1305048404, now seen corresponding path program 1 times [2022-07-21 09:58:28,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:58:28,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145691773] [2022-07-21 09:58:28,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:58:28,445 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:58:28,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:58:28,446 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-21 09:58:28,448 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-21 09:58:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:58:28,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 09:58:28,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:58:28,965 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-21 09:58:28,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:58:28,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:58:28,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145691773] [2022-07-21 09:58:28,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [145691773] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:58:28,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:58:28,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 09:58:28,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961812773] [2022-07-21 09:58:28,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:58:28,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:58:28,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:58:28,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:58:28,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 09:58:28,967 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-21 09:58:29,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:58:29,035 INFO L93 Difference]: Finished difference Result 2353 states and 3158 transitions. [2022-07-21 09:58:29,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:58:29,035 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-21 09:58:29,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:58:29,040 INFO L225 Difference]: With dead ends: 2353 [2022-07-21 09:58:29,040 INFO L226 Difference]: Without dead ends: 1334 [2022-07-21 09:58:29,043 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-21 09:58:29,044 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-21 09:58:29,044 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-21 09:58:29,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2022-07-21 09:58:29,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1330. [2022-07-21 09:58:29,075 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-21 09:58:29,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1804 transitions. [2022-07-21 09:58:29,097 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1804 transitions. Word has length 50 [2022-07-21 09:58:29,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:58:29,098 INFO L495 AbstractCegarLoop]: Abstraction has 1330 states and 1804 transitions. [2022-07-21 09:58:29,098 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-21 09:58:29,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1804 transitions. [2022-07-21 09:58:29,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-21 09:58:29,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:58:29,101 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-21 09:58:29,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-21 09:58:29,315 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-21 09:58:29,315 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:58:29,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:58:29,316 INFO L85 PathProgramCache]: Analyzing trace with hash -518166049, now seen corresponding path program 1 times [2022-07-21 09:58:29,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:58:29,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746087789] [2022-07-21 09:58:29,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:58:29,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:58:29,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:58:29,318 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-21 09:58:29,319 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-21 09:58:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:58:29,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 09:58:29,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:58:29,855 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-21 09:58:29,855 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:58:29,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:58:29,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746087789] [2022-07-21 09:58:29,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746087789] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:58:29,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:58:29,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:58:29,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747725111] [2022-07-21 09:58:29,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:58:29,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:58:29,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:58:29,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:58:29,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:58:29,857 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-21 09:58:30,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:58:30,031 INFO L93 Difference]: Finished difference Result 2669 states and 3616 transitions. [2022-07-21 09:58:30,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:58:30,032 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-21 09:58:30,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:58:30,037 INFO L225 Difference]: With dead ends: 2669 [2022-07-21 09:58:30,037 INFO L226 Difference]: Without dead ends: 1343 [2022-07-21 09:58:30,041 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-21 09:58:30,041 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-21 09:58:30,041 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-21 09:58:30,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2022-07-21 09:58:30,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1333. [2022-07-21 09:58:30,075 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-21 09:58:30,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1804 transitions. [2022-07-21 09:58:30,081 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1804 transitions. Word has length 72 [2022-07-21 09:58:30,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:58:30,082 INFO L495 AbstractCegarLoop]: Abstraction has 1333 states and 1804 transitions. [2022-07-21 09:58:30,082 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-21 09:58:30,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1804 transitions. [2022-07-21 09:58:30,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-21 09:58:30,084 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:58:30,084 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-21 09:58:30,101 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-21 09:58:30,300 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-21 09:58:30,301 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:58:30,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:58:30,301 INFO L85 PathProgramCache]: Analyzing trace with hash -84772232, now seen corresponding path program 1 times [2022-07-21 09:58:30,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:58:30,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6832621] [2022-07-21 09:58:30,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:58:30,302 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:58:30,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:58:30,303 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-21 09:58:30,303 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-21 09:58:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:58:30,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 09:58:30,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:58:30,833 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-21 09:58:30,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:58:30,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:58:30,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6832621] [2022-07-21 09:58:30,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [6832621] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:58:30,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:58:30,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:58:30,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803367088] [2022-07-21 09:58:30,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:58:30,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:58:30,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:58:30,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:58:30,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:58:30,836 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-21 09:58:31,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:58:31,017 INFO L93 Difference]: Finished difference Result 2675 states and 3616 transitions. [2022-07-21 09:58:31,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:58:31,018 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-21 09:58:31,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:58:31,023 INFO L225 Difference]: With dead ends: 2675 [2022-07-21 09:58:31,023 INFO L226 Difference]: Without dead ends: 1346 [2022-07-21 09:58:31,026 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-21 09:58:31,027 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.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:58:31,028 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.1s Time] [2022-07-21 09:58:31,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2022-07-21 09:58:31,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1330. [2022-07-21 09:58:31,054 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-21 09:58:31,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1798 transitions. [2022-07-21 09:58:31,059 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1798 transitions. Word has length 80 [2022-07-21 09:58:31,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:58:31,059 INFO L495 AbstractCegarLoop]: Abstraction has 1330 states and 1798 transitions. [2022-07-21 09:58:31,059 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-21 09:58:31,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1798 transitions. [2022-07-21 09:58:31,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-21 09:58:31,061 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:58:31,061 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-21 09:58:31,080 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-21 09:58:31,277 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-21 09:58:31,277 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:58:31,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:58:31,278 INFO L85 PathProgramCache]: Analyzing trace with hash -2140419496, now seen corresponding path program 1 times [2022-07-21 09:58:31,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:58:31,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211724060] [2022-07-21 09:58:31,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:58:31,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:58:31,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:58:31,280 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-21 09:58:31,280 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-21 09:58:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:58:31,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 09:58:31,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:58:32,041 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-21 09:58:32,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:58:32,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:58:32,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1211724060] [2022-07-21 09:58:32,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1211724060] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:58:32,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:58:32,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 09:58:32,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885820318] [2022-07-21 09:58:32,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:58:32,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:58:32,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:58:32,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:58:32,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:58:32,046 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-21 09:58:32,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:58:32,833 INFO L93 Difference]: Finished difference Result 2671 states and 3615 transitions. [2022-07-21 09:58:32,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:58:32,834 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-21 09:58:32,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:58:32,856 INFO L225 Difference]: With dead ends: 2671 [2022-07-21 09:58:32,856 INFO L226 Difference]: Without dead ends: 1351 [2022-07-21 09:58:32,859 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-21 09:58:32,860 INFO L413 NwaCegarLoop]: 702 mSDtfsCounter, 13 mSDsluCounter, 2777 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-07-21 09:58:32,860 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.7s Time] [2022-07-21 09:58:32,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2022-07-21 09:58:32,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1337. [2022-07-21 09:58:32,885 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-21 09:58:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1808 transitions. [2022-07-21 09:58:32,889 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1808 transitions. Word has length 146 [2022-07-21 09:58:32,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:58:32,890 INFO L495 AbstractCegarLoop]: Abstraction has 1337 states and 1808 transitions. [2022-07-21 09:58:32,890 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-21 09:58:32,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1808 transitions. [2022-07-21 09:58:32,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-21 09:58:32,891 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:58:32,892 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-21 09:58:32,928 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-21 09:58:33,111 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-21 09:58:33,111 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:58:33,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:58:33,112 INFO L85 PathProgramCache]: Analyzing trace with hash 971530265, now seen corresponding path program 1 times [2022-07-21 09:58:33,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:58:33,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082809275] [2022-07-21 09:58:33,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:58:33,113 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:58:33,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:58:33,114 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-21 09:58:33,114 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-21 09:58:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:58:33,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 09:58:33,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:58:33,868 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-21 09:58:33,873 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-21 09:58:33,956 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-21 09:58:33,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:58:33,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:58:33,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082809275] [2022-07-21 09:58:33,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082809275] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:58:33,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:58:33,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 09:58:33,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079144887] [2022-07-21 09:58:33,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:58:33,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:58:33,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:58:33,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:58:33,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 09:58:33,958 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-21 09:58:36,102 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-21 09:58:37,656 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:58:39,705 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-21 09:58:41,721 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-21 09:58:43,775 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-21 09:58:45,786 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-21 09:58:47,838 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-21 09:58:49,848 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-21 09:58:52,023 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-21 09:58:54,034 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-21 09:58:56,975 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:58:59,715 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-21 09:59:01,814 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:59:04,570 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:59:06,592 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-21 09:59:08,446 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:59:10,463 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-21 09:59:11,512 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:59:12,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:59:12,991 INFO L93 Difference]: Finished difference Result 1399 states and 1888 transitions. [2022-07-21 09:59:12,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:59:12,992 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-21 09:59:12,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:59:12,998 INFO L225 Difference]: With dead ends: 1399 [2022-07-21 09:59:12,998 INFO L226 Difference]: Without dead ends: 1339 [2022-07-21 09:59:12,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-21 09:59:12,999 INFO L413 NwaCegarLoop]: 687 mSDtfsCounter, 4 mSDsluCounter, 3176 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 1 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3863 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.9s IncrementalHoareTripleChecker+Time [2022-07-21 09:59:12,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3863 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 268 Invalid, 12 Unknown, 0 Unchecked, 38.9s Time] [2022-07-21 09:59:13,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2022-07-21 09:59:13,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2022-07-21 09:59:13,039 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-21 09:59:13,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1806 transitions. [2022-07-21 09:59:13,043 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1806 transitions. Word has length 146 [2022-07-21 09:59:13,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:59:13,043 INFO L495 AbstractCegarLoop]: Abstraction has 1337 states and 1806 transitions. [2022-07-21 09:59:13,043 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-21 09:59:13,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1806 transitions. [2022-07-21 09:59:13,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-21 09:59:13,045 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:59:13,045 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-21 09:59:13,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-21 09:59:13,263 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-21 09:59:13,263 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:59:13,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:59:13,264 INFO L85 PathProgramCache]: Analyzing trace with hash -480950281, now seen corresponding path program 1 times [2022-07-21 09:59:13,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:59:13,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1159863058] [2022-07-21 09:59:13,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:59:13,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:59:13,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:59:13,266 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-21 09:59:13,268 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-21 09:59:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:59:17,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-21 09:59:17,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:59:17,969 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-21 09:59:17,981 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-21 09:59:18,352 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-21 09:59:18,353 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-21 09:59:18,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:59:18,368 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-21 09:59:18,650 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-21 09:59:18,650 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-21 09:59:18,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:59:18,666 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-21 09:59:18,968 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-21 09:59:18,973 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-21 09:59:19,013 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-21 09:59:19,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:59:19,231 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-21 09:59:19,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:59:19,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1159863058] [2022-07-21 09:59:19,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1159863058] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:59:19,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 09:59:19,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2022-07-21 09:59:19,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206029655] [2022-07-21 09:59:19,232 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 09:59:19,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:59:19,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:59:19,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:59:19,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 09:59:19,233 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-21 09:59:21,158 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:59:23,219 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-21 09:59:25,262 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-21 09:59:27,313 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-21 09:59:29,445 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-21 09:59:33,112 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:59:34,236 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:59:36,505 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-21 09:59:38,229 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:59:39,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:59:39,608 INFO L93 Difference]: Finished difference Result 2386 states and 3197 transitions. [2022-07-21 09:59:39,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:59:39,609 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-21 09:59:39,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:59:39,613 INFO L225 Difference]: With dead ends: 2386 [2022-07-21 09:59:39,613 INFO L226 Difference]: Without dead ends: 1008 [2022-07-21 09:59:39,616 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-21 09:59:39,616 INFO L413 NwaCegarLoop]: 702 mSDtfsCounter, 2 mSDsluCounter, 3272 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3974 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:59:39,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3974 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 6 Unknown, 101 Unchecked, 20.2s Time] [2022-07-21 09:59:39,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2022-07-21 09:59:39,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 1008. [2022-07-21 09:59:39,636 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-21 09:59:39,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1336 transitions. [2022-07-21 09:59:39,639 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1336 transitions. Word has length 147 [2022-07-21 09:59:39,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:59:39,640 INFO L495 AbstractCegarLoop]: Abstraction has 1008 states and 1336 transitions. [2022-07-21 09:59:39,641 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-21 09:59:39,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1336 transitions. [2022-07-21 09:59:39,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-21 09:59:39,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:59:39,642 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-21 09:59:39,669 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-21 09:59:39,872 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-21 09:59:39,873 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:59:39,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:59:39,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1300549654, now seen corresponding path program 1 times [2022-07-21 09:59:39,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:59:39,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736188491] [2022-07-21 09:59:39,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:59:39,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:59:39,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:59:39,878 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-21 09:59:39,882 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-21 09:59:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:59:40,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 09:59:40,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:59:40,768 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-21 09:59:40,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:59:40,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:59:40,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736188491] [2022-07-21 09:59:40,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [736188491] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:59:40,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:59:40,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 09:59:40,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661742509] [2022-07-21 09:59:40,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:59:40,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:59:40,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:59:40,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:59:40,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 09:59:40,770 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-21 09:59:40,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:59:40,862 INFO L93 Difference]: Finished difference Result 1696 states and 2271 transitions. [2022-07-21 09:59:40,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:59:40,863 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-21 09:59:40,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:59:40,869 INFO L225 Difference]: With dead ends: 1696 [2022-07-21 09:59:40,869 INFO L226 Difference]: Without dead ends: 1011 [2022-07-21 09:59:40,871 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-21 09:59:40,871 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-21 09:59:40,872 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-21 09:59:40,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2022-07-21 09:59:40,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2022-07-21 09:59:40,893 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-21 09:59:40,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1338 transitions. [2022-07-21 09:59:40,896 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1338 transitions. Word has length 147 [2022-07-21 09:59:40,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:59:40,896 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 1338 transitions. [2022-07-21 09:59:40,896 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-21 09:59:40,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1338 transitions. [2022-07-21 09:59:40,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-21 09:59:40,898 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:59:40,899 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-21 09:59:40,939 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-21 09:59:41,119 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-21 09:59:41,119 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:59:41,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:59:41,120 INFO L85 PathProgramCache]: Analyzing trace with hash 345028375, now seen corresponding path program 2 times [2022-07-21 09:59:41,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 09:59:41,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059939327] [2022-07-21 09:59:41,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 09:59:41,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 09:59:41,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 09:59:41,122 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-21 09:59:41,123 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-21 09:59:42,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 09:59:42,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 09:59:42,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 09:59:42,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:59:43,210 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-21 09:59:43,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:59:43,969 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-21 09:59:43,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 09:59:43,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059939327] [2022-07-21 09:59:43,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1059939327] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:59:43,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 09:59:43,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2022-07-21 09:59:43,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779273796] [2022-07-21 09:59:43,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 09:59:43,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 09:59:43,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 09:59:43,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 09:59:43,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-21 09:59:43,971 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-21 09:59:46,334 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-21 09:59:48,413 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-21 09:59:50,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-21 09:59:54,548 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:59:56,568 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-21 09:59:58,584 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-21 10:00:00,689 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-21 10:00:03,860 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-21 10:00:05,102 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 10:00:07,117 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-21 10:00:09,799 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-21 10:00:13,587 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-21 10:00:15,601 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-21 10:00:17,611 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-21 10:00:19,779 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-21 10:00:21,795 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-21 10:00:23,813 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-21 10:00:26,563 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-21 10:00:28,575 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-21 10:00:30,581 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-21 10:00:32,640 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-21 10:00:34,650 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-21 10:00:36,661 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-21 10:00:38,990 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-21 10:00:41,004 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-21 10:00:43,061 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-21 10:00:45,083 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-21 10:00:47,734 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-21 10:00:49,744 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-21 10:00:51,755 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 []