./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 eb692b52 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-?-eb692b5 [2022-07-19 22:24:25,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 22:24:25,112 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 22:24:25,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 22:24:25,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 22:24:25,143 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 22:24:25,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 22:24:25,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 22:24:25,150 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 22:24:25,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 22:24:25,155 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 22:24:25,157 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 22:24:25,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 22:24:25,158 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 22:24:25,160 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 22:24:25,163 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 22:24:25,164 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 22:24:25,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 22:24:25,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 22:24:25,170 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 22:24:25,172 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 22:24:25,173 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 22:24:25,174 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 22:24:25,174 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 22:24:25,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 22:24:25,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 22:24:25,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 22:24:25,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 22:24:25,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 22:24:25,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 22:24:25,181 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 22:24:25,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 22:24:25,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 22:24:25,183 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 22:24:25,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 22:24:25,184 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 22:24:25,184 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 22:24:25,185 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 22:24:25,185 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 22:24:25,185 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 22:24:25,186 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 22:24:25,187 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 22:24:25,189 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 22:24:25,217 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 22:24:25,218 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 22:24:25,219 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 22:24:25,219 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 22:24:25,219 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 22:24:25,220 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 22:24:25,220 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 22:24:25,220 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 22:24:25,220 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 22:24:25,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 22:24:25,221 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 22:24:25,221 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 22:24:25,221 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 22:24:25,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 22:24:25,222 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 22:24:25,222 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 22:24:25,222 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 22:24:25,222 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 22:24:25,222 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 22:24:25,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 22:24:25,224 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 22:24:25,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:24:25,224 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 22:24:25,224 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 22:24:25,225 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 22:24:25,225 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 22:24:25,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 22:24:25,225 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 22:24:25,225 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 22:24:25,225 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 22:24:25,226 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-19 22:24:25,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 22:24:25,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 22:24:25,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 22:24:25,414 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 22:24:25,415 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 22:24:25,416 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-19 22:24:25,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d92638c6/b2eabfb2d32547af8cae0cd3057af593/FLAG515373a09 [2022-07-19 22:24:26,028 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 22:24:26,028 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-19 22:24:26,052 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d92638c6/b2eabfb2d32547af8cae0cd3057af593/FLAG515373a09 [2022-07-19 22:24:26,289 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d92638c6/b2eabfb2d32547af8cae0cd3057af593 [2022-07-19 22:24:26,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 22:24:26,292 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 22:24:26,294 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 22:24:26,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 22:24:26,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 22:24:26,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:24:26" (1/1) ... [2022-07-19 22:24:26,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@324ce618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:24:26, skipping insertion in model container [2022-07-19 22:24:26,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:24:26" (1/1) ... [2022-07-19 22:24:26,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 22:24:26,370 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 22:24:27,204 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-19 22:24:27,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:24:27,264 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 22:24:27,411 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-19 22:24:27,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:24:27,621 INFO L208 MainTranslator]: Completed translation [2022-07-19 22:24:27,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:24:27 WrapperNode [2022-07-19 22:24:27,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 22:24:27,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 22:24:27,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 22:24:27,624 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 22:24:27,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:24:27" (1/1) ... [2022-07-19 22:24:27,663 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:24:27" (1/1) ... [2022-07-19 22:24:27,731 INFO L137 Inliner]: procedures = 142, calls = 839, calls flagged for inlining = 59, calls inlined = 40, statements flattened = 1679 [2022-07-19 22:24:27,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 22:24:27,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 22:24:27,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 22:24:27,733 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 22:24:27,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:24:27" (1/1) ... [2022-07-19 22:24:27,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:24:27" (1/1) ... [2022-07-19 22:24:27,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:24:27" (1/1) ... [2022-07-19 22:24:27,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:24:27" (1/1) ... [2022-07-19 22:24:27,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:24:27" (1/1) ... [2022-07-19 22:24:27,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:24:27" (1/1) ... [2022-07-19 22:24:27,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:24:27" (1/1) ... [2022-07-19 22:24:27,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 22:24:27,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 22:24:27,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 22:24:27,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 22:24:27,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:24:27" (1/1) ... [2022-07-19 22:24:27,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:24:27,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:24:27,908 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-19 22:24:27,935 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-19 22:24:27,935 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-19 22:24:27,935 INFO L130 BoogieDeclarations]: Found specification of procedure catc_tx_run [2022-07-19 22:24:27,936 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_tx_run [2022-07-19 22:24:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-19 22:24:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-19 22:24:27,936 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-19 22:24:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-19 22:24:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-19 22:24:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 22:24:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-19 22:24:27,936 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-19 22:24:27,937 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-19 22:24:27,937 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-19 22:24:27,937 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_run [2022-07-19 22:24:27,937 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_run [2022-07-19 22:24:27,937 INFO L130 BoogieDeclarations]: Found specification of procedure catc_get_drvinfo [2022-07-19 22:24:27,937 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_get_drvinfo [2022-07-19 22:24:27,937 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_msg [2022-07-19 22:24:27,937 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_msg [2022-07-19 22:24:27,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-19 22:24:27,938 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-19 22:24:27,938 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-19 22:24:27,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-19 22:24:27,938 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-19 22:24:27,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-19 22:24:27,926 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-19 22:24:27,938 INFO L130 BoogieDeclarations]: Found specification of procedure catc_multicast [2022-07-19 22:24:27,939 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_multicast [2022-07-19 22:24:27,939 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-19 22:24:27,939 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-19 22:24:27,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 22:24:27,939 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-19 22:24:27,939 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-19 22:24:27,939 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-07-19 22:24:27,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-07-19 22:24:27,940 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-19 22:24:27,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-19 22:24:27,940 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-19 22:24:27,940 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-19 22:24:27,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-19 22:24:27,940 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-19 22:24:27,940 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-19 22:24:27,941 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-19 22:24:27,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 22:24:27,941 INFO L130 BoogieDeclarations]: Found specification of procedure crc32_le [2022-07-19 22:24:27,941 INFO L138 BoogieDeclarations]: Found implementation of procedure crc32_le [2022-07-19 22:24:27,941 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-19 22:24:27,941 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-19 22:24:27,941 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-19 22:24:27,941 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-19 22:24:27,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 22:24:27,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 22:24:27,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 22:24:27,942 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_async [2022-07-19 22:24:27,942 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_async [2022-07-19 22:24:27,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 22:24:27,943 INFO L130 BoogieDeclarations]: Found specification of procedure catc_exit [2022-07-19 22:24:27,943 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_exit [2022-07-19 22:24:27,944 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-19 22:24:27,944 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-19 22:24:27,945 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-19 22:24:27,945 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-19 22:24:27,945 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-19 22:24:27,945 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-19 22:24:27,945 INFO L130 BoogieDeclarations]: Found specification of procedure catc_init [2022-07-19 22:24:27,945 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_init [2022-07-19 22:24:27,946 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-19 22:24:27,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-19 22:24:27,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 22:24:27,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 22:24:27,946 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-19 22:24:27,946 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-19 22:24:27,946 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-07-19 22:24:27,946 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-07-19 22:24:27,946 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-19 22:24:27,947 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-19 22:24:27,947 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-19 22:24:27,947 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-19 22:24:27,947 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-19 22:24:27,947 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-19 22:24:27,948 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-07-19 22:24:27,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-07-19 22:24:27,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 22:24:27,948 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-19 22:24:27,948 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-19 22:24:27,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-19 22:24:27,948 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-07-19 22:24:27,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 22:24:27,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 22:24:28,282 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 22:24:28,284 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 22:24:28,919 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-07-19 22:24:29,004 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 22:24:29,011 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 22:24:29,670 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2022-07-19 22:24:29,670 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2022-07-19 22:24:29,670 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-07-19 22:24:29,670 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-07-19 22:24:29,684 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 22:24:29,704 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 22:24:29,705 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-07-19 22:24:29,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:24:29 BoogieIcfgContainer [2022-07-19 22:24:29,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 22:24:29,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 22:24:29,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 22:24:29,712 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 22:24:29,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:24:26" (1/3) ... [2022-07-19 22:24:29,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a694b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:24:29, skipping insertion in model container [2022-07-19 22:24:29,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:24:27" (2/3) ... [2022-07-19 22:24:29,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a694b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:24:29, skipping insertion in model container [2022-07-19 22:24:29,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:24:29" (3/3) ... [2022-07-19 22:24:29,715 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-07-19 22:24:29,727 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 22:24:29,727 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 22:24:29,793 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 22:24:29,800 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@67787e95, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@11214ec3 [2022-07-19 22:24:29,801 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 22:24:29,807 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-19 22:24:29,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-19 22:24:29,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:24:29,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:24:29,816 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:24:29,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:24:29,821 INFO L85 PathProgramCache]: Analyzing trace with hash -701775118, now seen corresponding path program 1 times [2022-07-19 22:24:29,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:24:29,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906867049] [2022-07-19 22:24:29,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:24:29,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:24:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:30,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:24:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:30,237 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-19 22:24:30,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:24:30,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906867049] [2022-07-19 22:24:30,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906867049] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:24:30,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:24:30,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 22:24:30,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430404005] [2022-07-19 22:24:30,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:24:30,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 22:24:30,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:24:30,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 22:24:30,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 22:24:30,262 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-19 22:24:30,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:24:30,379 INFO L93 Difference]: Finished difference Result 1092 states and 1610 transitions. [2022-07-19 22:24:30,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 22:24:30,394 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-19 22:24:30,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:24:30,413 INFO L225 Difference]: With dead ends: 1092 [2022-07-19 22:24:30,414 INFO L226 Difference]: Without dead ends: 548 [2022-07-19 22:24:30,422 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-19 22:24:30,426 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-19 22:24:30,428 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-19 22:24:30,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-07-19 22:24:30,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 543. [2022-07-19 22:24:30,504 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-19 22:24:30,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 710 transitions. [2022-07-19 22:24:30,509 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 710 transitions. Word has length 17 [2022-07-19 22:24:30,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:24:30,509 INFO L495 AbstractCegarLoop]: Abstraction has 543 states and 710 transitions. [2022-07-19 22:24:30,509 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-19 22:24:30,510 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 710 transitions. [2022-07-19 22:24:30,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-19 22:24:30,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:24:30,510 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:24:30,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 22:24:30,511 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:24:30,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:24:30,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1094802128, now seen corresponding path program 1 times [2022-07-19 22:24:30,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:24:30,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296571469] [2022-07-19 22:24:30,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:24:30,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:24:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:30,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:24:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:30,724 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-19 22:24:30,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:24:30,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296571469] [2022-07-19 22:24:30,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296571469] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:24:30,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:24:30,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 22:24:30,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033399183] [2022-07-19 22:24:30,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:24:30,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 22:24:30,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:24:30,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 22:24:30,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 22:24:30,729 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-19 22:24:30,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:24:30,790 INFO L93 Difference]: Finished difference Result 1589 states and 2102 transitions. [2022-07-19 22:24:30,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 22:24:30,792 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-19 22:24:30,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:24:30,799 INFO L225 Difference]: With dead ends: 1589 [2022-07-19 22:24:30,799 INFO L226 Difference]: Without dead ends: 1064 [2022-07-19 22:24:30,802 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-19 22:24:30,803 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-19 22:24:30,804 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-19 22:24:30,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2022-07-19 22:24:30,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1061. [2022-07-19 22:24:30,863 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-19 22:24:30,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1396 transitions. [2022-07-19 22:24:30,871 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1396 transitions. Word has length 17 [2022-07-19 22:24:30,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:24:30,871 INFO L495 AbstractCegarLoop]: Abstraction has 1061 states and 1396 transitions. [2022-07-19 22:24:30,872 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-19 22:24:30,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1396 transitions. [2022-07-19 22:24:30,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 22:24:30,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:24:30,873 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-19 22:24:30,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 22:24:30,873 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:24:30,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:24:30,873 INFO L85 PathProgramCache]: Analyzing trace with hash 420612946, now seen corresponding path program 1 times [2022-07-19 22:24:30,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:24:30,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109287879] [2022-07-19 22:24:30,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:24:30,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:24:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:30,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:24:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:31,011 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-19 22:24:31,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:24:31,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109287879] [2022-07-19 22:24:31,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109287879] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:24:31,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:24:31,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 22:24:31,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166196440] [2022-07-19 22:24:31,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:24:31,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 22:24:31,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:24:31,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 22:24:31,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 22:24:31,014 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-19 22:24:31,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:24:31,043 INFO L93 Difference]: Finished difference Result 1063 states and 1397 transitions. [2022-07-19 22:24:31,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 22:24:31,043 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-19 22:24:31,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:24:31,047 INFO L225 Difference]: With dead ends: 1063 [2022-07-19 22:24:31,048 INFO L226 Difference]: Without dead ends: 1052 [2022-07-19 22:24:31,050 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-19 22:24:31,053 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-19 22:24:31,054 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-19 22:24:31,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2022-07-19 22:24:31,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1047. [2022-07-19 22:24:31,089 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-19 22:24:31,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1376 transitions. [2022-07-19 22:24:31,094 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1376 transitions. Word has length 18 [2022-07-19 22:24:31,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:24:31,095 INFO L495 AbstractCegarLoop]: Abstraction has 1047 states and 1376 transitions. [2022-07-19 22:24:31,095 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-19 22:24:31,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1376 transitions. [2022-07-19 22:24:31,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-19 22:24:31,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:24:31,102 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-19 22:24:31,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 22:24:31,102 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:24:31,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:24:31,102 INFO L85 PathProgramCache]: Analyzing trace with hash -42685748, now seen corresponding path program 1 times [2022-07-19 22:24:31,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:24:31,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52759038] [2022-07-19 22:24:31,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:24:31,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:24:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:31,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:24:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:31,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 22:24:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:31,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:24:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:31,232 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-19 22:24:31,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:24:31,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52759038] [2022-07-19 22:24:31,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52759038] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:24:31,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:24:31,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 22:24:31,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184451378] [2022-07-19 22:24:31,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:24:31,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 22:24:31,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:24:31,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 22:24:31,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 22:24:31,249 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-19 22:24:32,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:24:32,154 INFO L93 Difference]: Finished difference Result 2403 states and 3232 transitions. [2022-07-19 22:24:32,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 22:24:32,155 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-19 22:24:32,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:24:32,161 INFO L225 Difference]: With dead ends: 2403 [2022-07-19 22:24:32,162 INFO L226 Difference]: Without dead ends: 1368 [2022-07-19 22:24:32,166 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-19 22:24:32,172 INFO L413 NwaCegarLoop]: 757 mSDtfsCounter, 427 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 22:24:32,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 1358 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-19 22:24:32,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2022-07-19 22:24:32,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1346. [2022-07-19 22:24:32,274 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-19 22:24:32,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1824 transitions. [2022-07-19 22:24:32,283 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1824 transitions. Word has length 50 [2022-07-19 22:24:32,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:24:32,283 INFO L495 AbstractCegarLoop]: Abstraction has 1346 states and 1824 transitions. [2022-07-19 22:24:32,284 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-19 22:24:32,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1824 transitions. [2022-07-19 22:24:32,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-19 22:24:32,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:24:32,299 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-19 22:24:32,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 22:24:32,299 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:24:32,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:24:32,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1108217249, now seen corresponding path program 1 times [2022-07-19 22:24:32,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:24:32,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020636894] [2022-07-19 22:24:32,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:24:32,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:24:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:32,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:24:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:32,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:24:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:32,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:24:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:32,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 22:24:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:32,408 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-19 22:24:32,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:24:32,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020636894] [2022-07-19 22:24:32,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020636894] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:24:32,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:24:32,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 22:24:32,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779019558] [2022-07-19 22:24:32,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:24:32,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:24:32,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:24:32,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:24:32,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:24:32,411 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-19 22:24:33,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:24:33,524 INFO L93 Difference]: Finished difference Result 2719 states and 3690 transitions. [2022-07-19 22:24:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 22:24:33,524 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-19 22:24:33,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:24:33,530 INFO L225 Difference]: With dead ends: 2719 [2022-07-19 22:24:33,530 INFO L226 Difference]: Without dead ends: 1374 [2022-07-19 22:24:33,533 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-19 22:24:33,534 INFO L413 NwaCegarLoop]: 682 mSDtfsCounter, 183 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:24:33,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1801 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-19 22:24:33,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2022-07-19 22:24:33,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1346. [2022-07-19 22:24:33,564 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-19 22:24:33,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1818 transitions. [2022-07-19 22:24:33,569 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1818 transitions. Word has length 72 [2022-07-19 22:24:33,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:24:33,569 INFO L495 AbstractCegarLoop]: Abstraction has 1346 states and 1818 transitions. [2022-07-19 22:24:33,569 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-19 22:24:33,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1818 transitions. [2022-07-19 22:24:33,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-19 22:24:33,570 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:24:33,571 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-19 22:24:33,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 22:24:33,571 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:24:33,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:24:33,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1223480200, now seen corresponding path program 1 times [2022-07-19 22:24:33,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:24:33,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6323496] [2022-07-19 22:24:33,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:24:33,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:24:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:33,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:24:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:33,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 22:24:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:33,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 22:24:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:33,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 22:24:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:33,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:24:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:33,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:24:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:33,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:24:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:33,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 22:24:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:33,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:33,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:33,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 22:24:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:33,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:33,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:33,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 22:24:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:33,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:33,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:33,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 22:24:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:33,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:33,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:33,845 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-19 22:24:33,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:24:33,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6323496] [2022-07-19 22:24:33,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6323496] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:24:33,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957857010] [2022-07-19 22:24:33,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:24:33,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:24:33,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:24:33,848 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-19 22:24:33,859 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-19 22:24:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:34,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 1884 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-19 22:24:34,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:24:34,335 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-19 22:24:34,338 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-19 22:24:34,381 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-19 22:24:34,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:24:34,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957857010] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:24:34,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:24:34,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-07-19 22:24:34,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226366116] [2022-07-19 22:24:34,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:24:34,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:24:34,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:24:34,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:24:34,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-19 22:24:34,382 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-19 22:24:35,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:24:35,267 INFO L93 Difference]: Finished difference Result 1408 states and 1898 transitions. [2022-07-19 22:24:35,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:24:35,267 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-19 22:24:35,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:24:35,273 INFO L225 Difference]: With dead ends: 1408 [2022-07-19 22:24:35,273 INFO L226 Difference]: Without dead ends: 1348 [2022-07-19 22:24:35,274 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-19 22:24:35,275 INFO L413 NwaCegarLoop]: 697 mSDtfsCounter, 4 mSDsluCounter, 3226 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.8s IncrementalHoareTripleChecker+Time [2022-07-19 22:24:35,275 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.8s Time] [2022-07-19 22:24:35,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2022-07-19 22:24:35,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1346. [2022-07-19 22:24:35,303 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-19 22:24:35,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1816 transitions. [2022-07-19 22:24:35,346 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1816 transitions. Word has length 146 [2022-07-19 22:24:35,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:24:35,348 INFO L495 AbstractCegarLoop]: Abstraction has 1346 states and 1816 transitions. [2022-07-19 22:24:35,348 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-19 22:24:35,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1816 transitions. [2022-07-19 22:24:35,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-19 22:24:35,350 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:24:35,351 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-19 22:24:35,388 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-19 22:24:35,572 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-19 22:24:35,572 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:24:35,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:24:35,573 INFO L85 PathProgramCache]: Analyzing trace with hash 193202081, now seen corresponding path program 1 times [2022-07-19 22:24:35,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:24:35,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464859245] [2022-07-19 22:24:35,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:24:35,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:24:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:35,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:24:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:35,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 22:24:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:35,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 22:24:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:35,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 22:24:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:35,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:24:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:35,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:24:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:35,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:24:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:35,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 22:24:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:35,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:35,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:35,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 22:24:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:35,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:35,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:35,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 22:24:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:35,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:35,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:35,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 22:24:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:35,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:35,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:35,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:35,777 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-19 22:24:35,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:24:35,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464859245] [2022-07-19 22:24:35,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464859245] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:24:35,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095081732] [2022-07-19 22:24:35,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:24:35,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:24:35,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:24:35,780 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-19 22:24:35,781 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-19 22:24:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:36,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 1889 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-19 22:24:36,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:24:36,234 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-19 22:24:36,234 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:24:36,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095081732] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:24:36,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:24:36,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2022-07-19 22:24:36,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233619409] [2022-07-19 22:24:36,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:24:36,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 22:24:36,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:24:36,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 22:24:36,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:24:36,236 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-19 22:24:36,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:24:36,314 INFO L93 Difference]: Finished difference Result 2703 states and 3651 transitions. [2022-07-19 22:24:36,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 22:24:36,315 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-19 22:24:36,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:24:36,320 INFO L225 Difference]: With dead ends: 2703 [2022-07-19 22:24:36,320 INFO L226 Difference]: Without dead ends: 1367 [2022-07-19 22:24:36,324 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-19 22:24:36,325 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-19 22:24:36,325 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-19 22:24:36,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2022-07-19 22:24:36,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1353. [2022-07-19 22:24:36,389 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-19 22:24:36,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1826 transitions. [2022-07-19 22:24:36,394 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1826 transitions. Word has length 147 [2022-07-19 22:24:36,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:24:36,395 INFO L495 AbstractCegarLoop]: Abstraction has 1353 states and 1826 transitions. [2022-07-19 22:24:36,395 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-19 22:24:36,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1826 transitions. [2022-07-19 22:24:36,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-19 22:24:36,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:24:36,399 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-19 22:24:36,422 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-19 22:24:36,622 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-19 22:24:36,622 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:24:36,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:24:36,622 INFO L85 PathProgramCache]: Analyzing trace with hash -2120603136, now seen corresponding path program 1 times [2022-07-19 22:24:36,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:24:36,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980667395] [2022-07-19 22:24:36,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:24:36,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:24:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:36,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:24:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:36,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 22:24:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:36,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 22:24:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:36,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 22:24:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:36,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:24:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:36,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:24:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:36,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:24:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:36,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 22:24:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:36,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:36,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:36,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 22:24:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:36,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:36,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:36,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 22:24:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:36,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:36,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:36,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 22:24:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:36,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:37,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:37,004 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-19 22:24:37,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:24:37,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980667395] [2022-07-19 22:24:37,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980667395] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:24:37,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735641427] [2022-07-19 22:24:37,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:24:37,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:24:37,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:24:37,006 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-19 22:24:37,008 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-19 22:24:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:37,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-19 22:24:37,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:24:37,499 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-19 22:24:37,503 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-19 22:24:37,629 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-19 22:24:37,629 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-19 22:24:37,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:37,636 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-19 22:24:37,794 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-19 22:24:37,795 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-19 22:24:37,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:37,802 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-19 22:24:38,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:38,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:38,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:38,086 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-19 22:24:38,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:38,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:38,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:38,097 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-19 22:24:38,155 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-19 22:24:38,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:24:38,360 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-19 22:24:38,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735641427] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:24:38,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:24:38,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 8] total 19 [2022-07-19 22:24:38,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829661994] [2022-07-19 22:24:38,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:24:38,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 22:24:38,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:24:38,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 22:24:38,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-07-19 22:24:38,363 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-19 22:24:42,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:24:42,249 INFO L93 Difference]: Finished difference Result 2464 states and 3330 transitions. [2022-07-19 22:24:42,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-19 22:24:42,249 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-19 22:24:42,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:24:42,254 INFO L225 Difference]: With dead ends: 2464 [2022-07-19 22:24:42,254 INFO L226 Difference]: Without dead ends: 1032 [2022-07-19 22:24:42,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 317 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2022-07-19 22:24:42,259 INFO L413 NwaCegarLoop]: 704 mSDtfsCounter, 170 mSDsluCounter, 3782 mSDsCounter, 0 mSdLazyCounter, 2473 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s 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.7s IncrementalHoareTripleChecker+Time [2022-07-19 22:24:42,260 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.7s Time] [2022-07-19 22:24:42,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2022-07-19 22:24:42,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1016. [2022-07-19 22:24:42,284 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-19 22:24:42,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1346 transitions. [2022-07-19 22:24:42,288 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1346 transitions. Word has length 147 [2022-07-19 22:24:42,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:24:42,288 INFO L495 AbstractCegarLoop]: Abstraction has 1016 states and 1346 transitions. [2022-07-19 22:24:42,288 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-19 22:24:42,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1346 transitions. [2022-07-19 22:24:42,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-19 22:24:42,290 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:24:42,290 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-19 22:24:42,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 22:24:42,507 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-19 22:24:42,508 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:24:42,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:24:42,508 INFO L85 PathProgramCache]: Analyzing trace with hash -339103201, now seen corresponding path program 1 times [2022-07-19 22:24:42,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:24:42,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129724772] [2022-07-19 22:24:42,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:24:42,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:24:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:42,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:24:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:42,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 22:24:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:42,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 22:24:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:42,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 22:24:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:42,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:24:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:42,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:24:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:42,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:24:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:42,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 22:24:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:42,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:42,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:42,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 22:24:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:42,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:42,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:42,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 22:24:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:42,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:42,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:42,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 22:24:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:42,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:42,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:42,855 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-19 22:24:42,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:24:42,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129724772] [2022-07-19 22:24:42,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129724772] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:24:42,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475675691] [2022-07-19 22:24:42,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:24:42,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:24:42,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:24:42,872 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-19 22:24:42,895 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-19 22:24:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:43,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 1897 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-19 22:24:43,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:24:43,503 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-19 22:24:43,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:24:43,755 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-19 22:24:43,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475675691] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:24:43,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:24:43,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 16 [2022-07-19 22:24:43,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090788283] [2022-07-19 22:24:43,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:24:43,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 22:24:43,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:24:43,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 22:24:43,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-07-19 22:24:43,756 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-19 22:24:48,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:24:48,947 INFO L93 Difference]: Finished difference Result 2099 states and 2804 transitions. [2022-07-19 22:24:48,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-19 22:24:48,948 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-19 22:24:48,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:24:48,954 INFO L225 Difference]: With dead ends: 2099 [2022-07-19 22:24:48,954 INFO L226 Difference]: Without dead ends: 1397 [2022-07-19 22:24:48,956 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-19 22:24:48,957 INFO L413 NwaCegarLoop]: 925 mSDtfsCounter, 2183 mSDsluCounter, 4045 mSDsCounter, 0 mSdLazyCounter, 4166 mSolverCounterSat, 1104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2314 SdHoareTripleChecker+Valid, 4970 SdHoareTripleChecker+Invalid, 5270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1104 IncrementalHoareTripleChecker+Valid, 4166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-19 22:24:48,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2314 Valid, 4970 Invalid, 5270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1104 Valid, 4166 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-19 22:24:48,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2022-07-19 22:24:48,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1372. [2022-07-19 22:24:48,990 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-19 22:24:48,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1823 transitions. [2022-07-19 22:24:48,994 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1823 transitions. Word has length 147 [2022-07-19 22:24:48,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:24:48,994 INFO L495 AbstractCegarLoop]: Abstraction has 1372 states and 1823 transitions. [2022-07-19 22:24:48,994 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-19 22:24:48,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1823 transitions. [2022-07-19 22:24:48,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-19 22:24:48,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:24:48,996 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-19 22:24:49,019 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-19 22:24:49,209 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-19 22:24:49,209 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:24:49,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:24:49,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1013490977, now seen corresponding path program 1 times [2022-07-19 22:24:49,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:24:49,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240636597] [2022-07-19 22:24:49,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:24:49,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:24:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:49,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:24:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:49,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 22:24:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:49,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 22:24:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:49,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 22:24:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:49,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:24:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:49,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:24:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:49,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:24:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:49,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 22:24:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:49,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:49,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:49,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 22:24:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:49,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:49,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:49,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 22:24:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:49,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:49,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:49,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 22:24:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:49,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:49,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:49,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-19 22:24:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:49,477 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-19 22:24:49,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:24:49,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240636597] [2022-07-19 22:24:49,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240636597] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:24:49,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233869025] [2022-07-19 22:24:49,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:24:49,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:24:49,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:24:49,479 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-19 22:24:49,480 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-19 22:24:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:49,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 1930 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-19 22:24:49,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:24:50,013 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-19 22:24:50,015 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-19 22:24:50,028 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-19 22:24:50,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:24:50,144 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-19 22:24:50,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233869025] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 22:24:50,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:24:50,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 12 [2022-07-19 22:24:50,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472663870] [2022-07-19 22:24:50,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:24:50,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:24:50,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:24:50,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:24:50,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:24:50,146 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-19 22:24:51,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:24:51,146 INFO L93 Difference]: Finished difference Result 1437 states and 1901 transitions. [2022-07-19 22:24:51,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:24:51,147 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-19 22:24:51,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:24:51,152 INFO L225 Difference]: With dead ends: 1437 [2022-07-19 22:24:51,152 INFO L226 Difference]: Without dead ends: 1372 [2022-07-19 22:24:51,153 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-19 22:24:51,153 INFO L413 NwaCegarLoop]: 698 mSDtfsCounter, 5 mSDsluCounter, 3225 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3923 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 22:24:51,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3923 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 22:24:51,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2022-07-19 22:24:51,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1372. [2022-07-19 22:24:51,232 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-19 22:24:51,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1822 transitions. [2022-07-19 22:24:51,236 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1822 transitions. Word has length 157 [2022-07-19 22:24:51,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:24:51,236 INFO L495 AbstractCegarLoop]: Abstraction has 1372 states and 1822 transitions. [2022-07-19 22:24:51,236 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-19 22:24:51,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1822 transitions. [2022-07-19 22:24:51,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-19 22:24:51,239 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:24:51,239 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-19 22:24:51,277 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-19 22:24:51,454 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-19 22:24:51,454 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:24:51,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:24:51,455 INFO L85 PathProgramCache]: Analyzing trace with hash -497932717, now seen corresponding path program 1 times [2022-07-19 22:24:51,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:24:51,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470780159] [2022-07-19 22:24:51,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:24:51,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:24:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:51,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:24:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:51,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 22:24:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:51,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 22:24:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:51,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 22:24:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:51,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:24:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:51,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:24:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:51,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:24:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:51,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 22:24:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:51,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:51,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:51,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 22:24:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:51,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:51,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:51,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 22:24:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:51,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:51,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:51,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 22:24:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:51,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:51,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:51,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-19 22:24:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:51,739 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-19 22:24:51,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:24:51,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470780159] [2022-07-19 22:24:51,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470780159] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:24:51,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764504792] [2022-07-19 22:24:51,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:24:51,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:24:51,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:24:51,742 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-19 22:24:51,762 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-19 22:24:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:52,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 1935 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-19 22:24:52,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:24:52,234 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-19 22:24:52,238 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-19 22:24:52,326 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-19 22:24:52,326 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-19 22:24:52,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:52,330 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-19 22:24:52,446 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-19 22:24:52,447 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-19 22:24:52,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:52,452 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-19 22:24:52,494 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-19 22:24:52,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:24:52,651 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-19 22:24:52,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764504792] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:24:52,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:24:52,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 17 [2022-07-19 22:24:52,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214823940] [2022-07-19 22:24:52,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:24:52,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 22:24:52,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:24:52,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 22:24:52,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-07-19 22:24:52,653 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-19 22:24:55,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:24:55,869 INFO L93 Difference]: Finished difference Result 2452 states and 3275 transitions. [2022-07-19 22:24:55,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 22:24:55,870 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-19 22:24:55,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:24:55,875 INFO L225 Difference]: With dead ends: 2452 [2022-07-19 22:24:55,875 INFO L226 Difference]: Without dead ends: 1374 [2022-07-19 22:24:55,878 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-19 22:24:55,878 INFO L413 NwaCegarLoop]: 691 mSDtfsCounter, 173 mSDsluCounter, 3386 mSDsCounter, 0 mSdLazyCounter, 2511 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 4077 SdHoareTripleChecker+Invalid, 3061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 2511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 416 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:24:55,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 4077 Invalid, 3061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 2511 Invalid, 0 Unknown, 416 Unchecked, 3.1s Time] [2022-07-19 22:24:55,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2022-07-19 22:24:55,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1372. [2022-07-19 22:24:55,908 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-19 22:24:55,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1821 transitions. [2022-07-19 22:24:55,912 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1821 transitions. Word has length 158 [2022-07-19 22:24:55,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:24:55,912 INFO L495 AbstractCegarLoop]: Abstraction has 1372 states and 1821 transitions. [2022-07-19 22:24:55,913 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-19 22:24:55,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1821 transitions. [2022-07-19 22:24:55,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-19 22:24:55,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:24:55,914 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-19 22:24:55,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 22:24:56,127 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-19 22:24:56,128 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:24:56,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:24:56,128 INFO L85 PathProgramCache]: Analyzing trace with hash 865652627, now seen corresponding path program 1 times [2022-07-19 22:24:56,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:24:56,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939172515] [2022-07-19 22:24:56,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:24:56,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:24:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:56,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:24:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:56,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 22:24:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:56,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 22:24:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:56,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 22:24:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:56,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:24:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:56,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:24:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:56,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:24:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:56,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 22:24:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:56,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:56,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:56,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 22:24:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:56,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:56,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:56,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 22:24:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:56,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:56,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:56,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 22:24:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:56,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:56,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:24:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:56,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-19 22:24:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:56,369 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-19 22:24:56,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:24:56,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939172515] [2022-07-19 22:24:56,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939172515] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:24:56,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940340829] [2022-07-19 22:24:56,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:24:56,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:24:56,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:24:56,371 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-19 22:24:56,377 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-19 22:24:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:56,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 1961 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-19 22:24:56,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:24:57,016 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-19 22:24:57,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:24:57,305 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-19 22:24:57,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940340829] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:24:57,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:24:57,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 11] total 22 [2022-07-19 22:24:57,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121809699] [2022-07-19 22:24:57,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:24:57,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 22:24:57,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:24:57,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 22:24:57,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2022-07-19 22:24:57,307 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-19 22:25:03,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:25:03,282 INFO L93 Difference]: Finished difference Result 2837 states and 3755 transitions. [2022-07-19 22:25:03,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-19 22:25:03,283 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-19 22:25:03,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:25:03,290 INFO L225 Difference]: With dead ends: 2837 [2022-07-19 22:25:03,290 INFO L226 Difference]: Without dead ends: 1782 [2022-07-19 22:25:03,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=415, Invalid=1565, Unknown=0, NotChecked=0, Total=1980 [2022-07-19 22:25:03,293 INFO L413 NwaCegarLoop]: 964 mSDtfsCounter, 2605 mSDsluCounter, 4877 mSDsCounter, 0 mSdLazyCounter, 5661 mSolverCounterSat, 1381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s 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.6s IncrementalHoareTripleChecker+Time [2022-07-19 22:25:03,294 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.6s Time] [2022-07-19 22:25:03,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2022-07-19 22:25:03,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1735. [2022-07-19 22:25:03,343 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-19 22:25:03,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2287 transitions. [2022-07-19 22:25:03,347 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2287 transitions. Word has length 158 [2022-07-19 22:25:03,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:25:03,348 INFO L495 AbstractCegarLoop]: Abstraction has 1735 states and 2287 transitions. [2022-07-19 22:25:03,348 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-19 22:25:03,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2287 transitions. [2022-07-19 22:25:03,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-19 22:25:03,350 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:25:03,350 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-19 22:25:03,385 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-19 22:25:03,586 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-19 22:25:03,586 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:25:03,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:25:03,587 INFO L85 PathProgramCache]: Analyzing trace with hash -2103165584, now seen corresponding path program 1 times [2022-07-19 22:25:03,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:25:03,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618135250] [2022-07-19 22:25:03,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:25:03,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:25:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:03,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:25:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:03,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 22:25:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:03,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 22:25:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:03,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 22:25:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:03,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:25:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:03,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:25:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:03,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:25:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:03,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 22:25:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:03,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:03,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:03,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 22:25:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:03,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:03,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:03,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 22:25:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:03,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:03,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:03,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 22:25:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:03,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:03,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:03,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-19 22:25:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:03,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-19 22:25:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:03,817 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-19 22:25:03,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:25:03,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618135250] [2022-07-19 22:25:03,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618135250] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:25:03,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592127031] [2022-07-19 22:25:03,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:25:03,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:25:03,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:25:03,820 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-19 22:25:03,821 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-19 22:25:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:04,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 1967 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-19 22:25:04,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:25:04,467 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-19 22:25:04,469 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-19 22:25:04,482 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-19 22:25:04,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:25:04,601 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-19 22:25:04,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592127031] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 22:25:04,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:25:04,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 12 [2022-07-19 22:25:04,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633065209] [2022-07-19 22:25:04,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:25:04,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:25:04,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:25:04,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:25:04,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:25:04,604 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-19 22:25:05,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:25:05,486 INFO L93 Difference]: Finished difference Result 1822 states and 2390 transitions. [2022-07-19 22:25:05,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:25:05,487 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-19 22:25:05,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:25:05,493 INFO L225 Difference]: With dead ends: 1822 [2022-07-19 22:25:05,493 INFO L226 Difference]: Without dead ends: 1735 [2022-07-19 22:25:05,494 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-19 22:25:05,495 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.8s IncrementalHoareTripleChecker+Time [2022-07-19 22:25:05,495 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.8s Time] [2022-07-19 22:25:05,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-07-19 22:25:05,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1735. [2022-07-19 22:25:05,534 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-19 22:25:05,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2286 transitions. [2022-07-19 22:25:05,538 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2286 transitions. Word has length 168 [2022-07-19 22:25:05,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:25:05,538 INFO L495 AbstractCegarLoop]: Abstraction has 1735 states and 2286 transitions. [2022-07-19 22:25:05,538 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-19 22:25:05,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2286 transitions. [2022-07-19 22:25:05,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-19 22:25:05,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:25:05,540 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-19 22:25:05,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-19 22:25:05,759 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-19 22:25:05,760 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:25:05,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:25:05,760 INFO L85 PathProgramCache]: Analyzing trace with hash -332857001, now seen corresponding path program 1 times [2022-07-19 22:25:05,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:25:05,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268972609] [2022-07-19 22:25:05,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:25:05,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:25:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:05,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:25:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:05,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 22:25:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:05,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 22:25:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:05,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 22:25:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:05,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:25:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:05,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:25:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:05,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:25:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:05,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 22:25:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:05,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:05,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:05,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 22:25:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:05,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:05,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:05,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 22:25:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:05,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:05,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:05,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 22:25:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:05,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:05,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:05,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 22:25:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:05,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-19 22:25:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:05,961 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-19 22:25:05,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:25:05,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268972609] [2022-07-19 22:25:05,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268972609] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:25:05,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033324404] [2022-07-19 22:25:05,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:25:05,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:25:05,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:25:05,964 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-19 22:25:05,965 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-19 22:25:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:06,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 1972 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-19 22:25:06,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:25:06,504 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-19 22:25:06,508 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-19 22:25:06,666 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-19 22:25:06,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, 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-19 22:25:06,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:25:06,672 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-19 22:25:06,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:25:06,980 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-19 22:25:06,983 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 22:25:06,984 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-19 22:25:07,024 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-19 22:25:07,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:25:07,153 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-19 22:25:07,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033324404] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:25:07,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:25:07,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 8] total 17 [2022-07-19 22:25:07,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942348265] [2022-07-19 22:25:07,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:25:07,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 22:25:07,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:25:07,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 22:25:07,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-07-19 22:25:07,155 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-19 22:25:09,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:25:09,652 INFO L93 Difference]: Finished difference Result 3174 states and 4193 transitions. [2022-07-19 22:25:09,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 22:25:09,652 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-19 22:25:09,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:25:09,658 INFO L225 Difference]: With dead ends: 3174 [2022-07-19 22:25:09,659 INFO L226 Difference]: Without dead ends: 1735 [2022-07-19 22:25:09,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 365 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-07-19 22:25:09,662 INFO L413 NwaCegarLoop]: 689 mSDtfsCounter, 177 mSDsluCounter, 4018 mSDsCounter, 0 mSdLazyCounter, 2225 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 4707 SdHoareTripleChecker+Invalid, 3152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 2225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 795 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 22:25:09,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 4707 Invalid, 3152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 2225 Invalid, 0 Unknown, 795 Unchecked, 2.3s Time] [2022-07-19 22:25:09,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-07-19 22:25:09,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1735. [2022-07-19 22:25:09,701 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-19 22:25:09,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2285 transitions. [2022-07-19 22:25:09,704 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2285 transitions. Word has length 169 [2022-07-19 22:25:09,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:25:09,705 INFO L495 AbstractCegarLoop]: Abstraction has 1735 states and 2285 transitions. [2022-07-19 22:25:09,705 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-19 22:25:09,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2285 transitions. [2022-07-19 22:25:09,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-19 22:25:09,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:25:09,707 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-19 22:25:09,734 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-19 22:25:09,927 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-19 22:25:09,927 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:25:09,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:25:09,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1756471977, now seen corresponding path program 1 times [2022-07-19 22:25:09,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:25:09,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746063704] [2022-07-19 22:25:09,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:25:09,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:25:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:10,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:25:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:10,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 22:25:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:10,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 22:25:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:10,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 22:25:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:10,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:25:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:10,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:25:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:10,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:25:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:10,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 22:25:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:10,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:10,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:10,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 22:25:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:10,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:10,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:10,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 22:25:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:10,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:10,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:10,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 22:25:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:10,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:10,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:10,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 22:25:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:10,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-19 22:25:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:10,230 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-19 22:25:10,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:25:10,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746063704] [2022-07-19 22:25:10,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746063704] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:25:10,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:25:10,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-19 22:25:10,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228290083] [2022-07-19 22:25:10,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:25:10,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 22:25:10,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:25:10,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 22:25:10,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-19 22:25:10,232 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-19 22:25:14,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:25:14,194 INFO L93 Difference]: Finished difference Result 1826 states and 2397 transitions. [2022-07-19 22:25:14,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 22:25:14,195 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-19 22:25:14,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:25:14,201 INFO L225 Difference]: With dead ends: 1826 [2022-07-19 22:25:14,201 INFO L226 Difference]: Without dead ends: 1748 [2022-07-19 22:25:14,202 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-19 22:25:14,203 INFO L413 NwaCegarLoop]: 674 mSDtfsCounter, 502 mSDsluCounter, 4055 mSDsCounter, 0 mSdLazyCounter, 3157 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 4729 SdHoareTripleChecker+Invalid, 3560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 3157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-19 22:25:14,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 4729 Invalid, 3560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 3157 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-19 22:25:14,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2022-07-19 22:25:14,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1740. [2022-07-19 22:25:14,244 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-19 22:25:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 2290 transitions. [2022-07-19 22:25:14,248 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 2290 transitions. Word has length 169 [2022-07-19 22:25:14,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:25:14,248 INFO L495 AbstractCegarLoop]: Abstraction has 1740 states and 2290 transitions. [2022-07-19 22:25:14,249 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-19 22:25:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2290 transitions. [2022-07-19 22:25:14,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-19 22:25:14,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:25:14,251 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-19 22:25:14,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 22:25:14,251 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:25:14,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:25:14,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1061543817, now seen corresponding path program 2 times [2022-07-19 22:25:14,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:25:14,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374212323] [2022-07-19 22:25:14,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:25:14,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:25:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:14,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:25:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:14,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 22:25:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:14,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 22:25:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:14,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 22:25:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:14,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:25:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:14,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:25:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:14,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:25:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:14,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 22:25:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:14,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:14,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:14,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 22:25:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:14,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:14,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:14,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 22:25:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:14,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:14,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:14,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 22:25:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:14,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:14,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:14,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 22:25:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:14,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-19 22:25:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:14,517 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-19 22:25:14,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:25:14,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374212323] [2022-07-19 22:25:14,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374212323] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:25:14,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13996326] [2022-07-19 22:25:14,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 22:25:14,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:25:14,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:25:14,535 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-19 22:25:14,547 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-19 22:25:15,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 22:25:15,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 22:25:15,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 1980 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-19 22:25:15,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:25:15,280 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-19 22:25:15,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:25:15,629 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-19 22:25:15,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13996326] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:25:15,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:25:15,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 15] total 24 [2022-07-19 22:25:15,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089734288] [2022-07-19 22:25:15,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:25:15,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-19 22:25:15,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:25:15,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-19 22:25:15,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2022-07-19 22:25:15,631 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-19 22:25:20,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:25:20,696 INFO L93 Difference]: Finished difference Result 2197 states and 2842 transitions. [2022-07-19 22:25:20,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-19 22:25:20,697 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-19 22:25:20,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:25:20,708 INFO L225 Difference]: With dead ends: 2197 [2022-07-19 22:25:20,708 INFO L226 Difference]: Without dead ends: 2185 [2022-07-19 22:25:20,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=442, Invalid=1118, Unknown=0, NotChecked=0, Total=1560 [2022-07-19 22:25:20,710 INFO L413 NwaCegarLoop]: 990 mSDtfsCounter, 6428 mSDsluCounter, 3541 mSDsCounter, 0 mSdLazyCounter, 4921 mSolverCounterSat, 2976 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s 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-19 22:25:20,710 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-19 22:25:20,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2022-07-19 22:25:20,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 2105. [2022-07-19 22:25:20,762 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-19 22:25:20,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 2753 transitions. [2022-07-19 22:25:20,767 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 2753 transitions. Word has length 169 [2022-07-19 22:25:20,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:25:20,767 INFO L495 AbstractCegarLoop]: Abstraction has 2105 states and 2753 transitions. [2022-07-19 22:25:20,768 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-19 22:25:20,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 2753 transitions. [2022-07-19 22:25:20,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-07-19 22:25:20,770 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:25:20,770 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-19 22:25:20,793 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-19 22:25:20,982 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-19 22:25:20,983 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:25:20,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:25:20,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1170991758, now seen corresponding path program 1 times [2022-07-19 22:25:20,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:25:20,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292462897] [2022-07-19 22:25:20,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:25:20,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:25:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:21,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:25:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:21,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 22:25:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:21,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 22:25:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:21,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 22:25:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:21,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:25:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:21,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:25:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:21,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:25:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:21,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 22:25:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:21,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:21,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:21,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 22:25:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:21,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:21,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:21,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 22:25:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:21,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:21,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:21,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 22:25:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:21,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:21,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:21,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 22:25:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:21,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-19 22:25:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:21,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-19 22:25:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:21,245 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-19 22:25:21,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:25:21,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292462897] [2022-07-19 22:25:21,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292462897] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:25:21,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325431277] [2022-07-19 22:25:21,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:25:21,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:25:21,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:25:21,247 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-19 22:25:21,248 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-19 22:25:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:21,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 2004 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-19 22:25:21,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:25:21,959 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-19 22:25:21,962 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-19 22:25:21,973 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-19 22:25:21,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:25:22,084 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-19 22:25:22,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325431277] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 22:25:22,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:25:22,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 12 [2022-07-19 22:25:22,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405571974] [2022-07-19 22:25:22,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:25:22,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:25:22,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:25:22,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:25:22,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:25:22,086 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-19 22:25:22,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:25:22,971 INFO L93 Difference]: Finished difference Result 2171 states and 2812 transitions. [2022-07-19 22:25:22,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:25:22,971 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-19 22:25:22,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:25:22,978 INFO L225 Difference]: With dead ends: 2171 [2022-07-19 22:25:22,979 INFO L226 Difference]: Without dead ends: 2076 [2022-07-19 22:25:22,980 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-19 22:25:22,980 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.8s IncrementalHoareTripleChecker+Time [2022-07-19 22:25:22,980 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.8s Time] [2022-07-19 22:25:22,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2022-07-19 22:25:23,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 2071. [2022-07-19 22:25:23,026 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-19 22:25:23,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 2694 transitions. [2022-07-19 22:25:23,030 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 2694 transitions. Word has length 179 [2022-07-19 22:25:23,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:25:23,030 INFO L495 AbstractCegarLoop]: Abstraction has 2071 states and 2694 transitions. [2022-07-19 22:25:23,030 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-19 22:25:23,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 2694 transitions. [2022-07-19 22:25:23,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-07-19 22:25:23,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:25:23,033 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-19 22:25:23,055 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-19 22:25:23,252 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-19 22:25:23,252 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:25:23,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:25:23,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1646245098, now seen corresponding path program 1 times [2022-07-19 22:25:23,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:25:23,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005803439] [2022-07-19 22:25:23,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:25:23,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:25:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:25:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 22:25:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 22:25:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 22:25:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:25:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:25:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:25:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 22:25:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 22:25:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 22:25:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 22:25:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 22:25:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-19 22:25:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-19 22:25:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-19 22:25:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-19 22:25:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-19 22:25:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-19 22:25:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-19 22:25:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-19 22:25:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-19 22:25:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-19 22:25:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-19 22:25:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:23,623 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-19 22:25:23,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:25:23,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005803439] [2022-07-19 22:25:23,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005803439] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:25:23,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:25:23,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 22:25:23,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809520645] [2022-07-19 22:25:23,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:25:23,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 22:25:23,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:25:23,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 22:25:23,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:25:23,625 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-19 22:25:26,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:25:26,685 INFO L93 Difference]: Finished difference Result 3867 states and 5086 transitions. [2022-07-19 22:25:26,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 22:25:26,685 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-19 22:25:26,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:25:26,693 INFO L225 Difference]: With dead ends: 3867 [2022-07-19 22:25:26,693 INFO L226 Difference]: Without dead ends: 2110 [2022-07-19 22:25:26,696 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-19 22:25:26,697 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.9s IncrementalHoareTripleChecker+Time [2022-07-19 22:25:26,697 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.9s Time] [2022-07-19 22:25:26,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2110 states. [2022-07-19 22:25:26,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 2064. [2022-07-19 22:25:26,754 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-19 22:25:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2686 transitions. [2022-07-19 22:25:26,758 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2686 transitions. Word has length 263 [2022-07-19 22:25:26,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:25:26,758 INFO L495 AbstractCegarLoop]: Abstraction has 2064 states and 2686 transitions. [2022-07-19 22:25:26,759 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-19 22:25:26,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2686 transitions. [2022-07-19 22:25:26,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-07-19 22:25:26,761 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:25:26,761 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-19 22:25:26,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 22:25:26,761 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:25:26,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:25:26,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1841616438, now seen corresponding path program 1 times [2022-07-19 22:25:26,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:25:26,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569825688] [2022-07-19 22:25:26,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:25:26,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:25:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:26,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:25:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:26,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 22:25:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:26,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 22:25:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:26,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 22:25:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:26,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:25:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:26,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:25:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:26,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:25:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:26,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 22:25:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:26,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:26,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:26,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 22:25:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:26,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:26,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:26,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 22:25:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:26,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:26,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:26,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 22:25:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:26,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:26,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:26,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 22:25:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:26,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-19 22:25:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:26,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-19 22:25:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:26,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-19 22:25:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:26,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-19 22:25:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:26,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-19 22:25:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:27,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-19 22:25:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:27,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:27,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-19 22:25:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:27,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:27,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-19 22:25:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:27,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:27,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-19 22:25:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:27,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-19 22:25:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:27,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-19 22:25:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:27,037 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-19 22:25:27,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:25:27,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569825688] [2022-07-19 22:25:27,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569825688] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:25:27,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:25:27,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 22:25:27,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916093506] [2022-07-19 22:25:27,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:25:27,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:25:27,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:25:27,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:25:27,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:25:27,040 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-19 22:25:29,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:25:29,312 INFO L93 Difference]: Finished difference Result 2130 states and 2809 transitions. [2022-07-19 22:25:29,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 22:25:29,313 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-19 22:25:29,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:25:29,320 INFO L225 Difference]: With dead ends: 2130 [2022-07-19 22:25:29,320 INFO L226 Difference]: Without dead ends: 2120 [2022-07-19 22:25:29,321 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-19 22:25:29,321 INFO L413 NwaCegarLoop]: 833 mSDtfsCounter, 1346 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 731 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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, 2.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:25:29,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1444 Valid, 2378 Invalid, 1823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [731 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-19 22:25:29,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2022-07-19 22:25:29,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 2064. [2022-07-19 22:25:29,378 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-19 22:25:29,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2685 transitions. [2022-07-19 22:25:29,382 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2685 transitions. Word has length 263 [2022-07-19 22:25:29,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:25:29,383 INFO L495 AbstractCegarLoop]: Abstraction has 2064 states and 2685 transitions. [2022-07-19 22:25:29,383 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-19 22:25:29,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2685 transitions. [2022-07-19 22:25:29,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-07-19 22:25:29,385 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:25:29,385 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-19 22:25:29,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 22:25:29,385 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:25:29,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:25:29,386 INFO L85 PathProgramCache]: Analyzing trace with hash 810198159, now seen corresponding path program 1 times [2022-07-19 22:25:29,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:25:29,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410972908] [2022-07-19 22:25:29,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:25:29,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:25:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:25:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 22:25:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 22:25:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 22:25:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:25:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:25:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:25:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 22:25:29,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 22:25:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 22:25:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 22:25:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 22:25:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-19 22:25:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-19 22:25:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-19 22:25:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-19 22:25:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-19 22:25:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-19 22:25:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-19 22:25:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-19 22:25:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-19 22:25:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-19 22:25:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-07-19 22:25:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:29,711 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-19 22:25:29,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:25:29,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410972908] [2022-07-19 22:25:29,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410972908] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:25:29,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956816426] [2022-07-19 22:25:29,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:25:29,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:25:29,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:25:29,713 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-19 22:25:29,714 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-19 22:25:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:30,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 3081 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 22:25:30,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:25:30,579 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-19 22:25:30,579 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:25:30,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956816426] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:25:30,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:25:30,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-19 22:25:30,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867724799] [2022-07-19 22:25:30,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:25:30,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 22:25:30,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:25:30,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 22:25:30,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:25:30,581 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-19 22:25:30,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:25:30,823 INFO L93 Difference]: Finished difference Result 3806 states and 4963 transitions. [2022-07-19 22:25:30,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 22:25:30,823 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-19 22:25:30,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:25:30,836 INFO L225 Difference]: With dead ends: 3806 [2022-07-19 22:25:30,836 INFO L226 Difference]: Without dead ends: 2068 [2022-07-19 22:25:30,839 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-19 22:25:30,841 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-19 22:25:30,842 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-19 22:25:30,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2022-07-19 22:25:30,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 2064. [2022-07-19 22:25:30,899 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-19 22:25:30,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2683 transitions. [2022-07-19 22:25:30,904 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2683 transitions. Word has length 268 [2022-07-19 22:25:30,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:25:30,906 INFO L495 AbstractCegarLoop]: Abstraction has 2064 states and 2683 transitions. [2022-07-19 22:25:30,906 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-19 22:25:30,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2683 transitions. [2022-07-19 22:25:30,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2022-07-19 22:25:30,908 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:25:30,909 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-19 22:25:30,932 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-19 22:25:31,121 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-19 22:25:31,122 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:25:31,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:25:31,122 INFO L85 PathProgramCache]: Analyzing trace with hash 589418021, now seen corresponding path program 1 times [2022-07-19 22:25:31,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:25:31,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253369269] [2022-07-19 22:25:31,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:25:31,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:25:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:25:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 22:25:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 22:25:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 22:25:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:25:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:25:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:25:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 22:25:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 22:25:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 22:25:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 22:25:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:25:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 22:25:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-19 22:25:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-19 22:25:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-19 22:25:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-19 22:25:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-19 22:25:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-19 22:25:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-19 22:25:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-19 22:25:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:25:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-19 22:25:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-19 22:25:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-19 22:25:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-07-19 22:25:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-19 22:25:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-07-19 22:25:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:31,418 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-19 22:25:31,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:25:31,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253369269] [2022-07-19 22:25:31,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253369269] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:25:31,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420936377] [2022-07-19 22:25:31,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:25:31,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:25:31,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:25:31,433 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-19 22:25:31,434 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-19 22:25:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:25:32,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 3178 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 22:25:32,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:25:32,452 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-19 22:25:32,452 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:25:32,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420936377] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:25:32,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:25:32,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-07-19 22:25:32,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386876769] [2022-07-19 22:25:32,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:25:32,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 22:25:32,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:25:32,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 22:25:32,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:25:32,454 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-19 22:25:32,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:25:32,644 INFO L93 Difference]: Finished difference Result 3810 states and 4981 transitions. [2022-07-19 22:25:32,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:25:32,645 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-19 22:25:32,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:25:32,650 INFO L225 Difference]: With dead ends: 3810 [2022-07-19 22:25:32,650 INFO L226 Difference]: Without dead ends: 2072 [2022-07-19 22:25:32,653 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-19 22:25:32,654 INFO L413 NwaCegarLoop]: 659 mSDtfsCounter, 30 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1913 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:25:32,654 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-19 22:25:32,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2022-07-19 22:25:32,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 2072. [2022-07-19 22:25:32,708 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-19 22:25:32,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 2691 transitions. [2022-07-19 22:25:32,713 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 2691 transitions. Word has length 288 [2022-07-19 22:25:32,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:25:32,713 INFO L495 AbstractCegarLoop]: Abstraction has 2072 states and 2691 transitions. [2022-07-19 22:25:32,713 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-19 22:25:32,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2691 transitions. [2022-07-19 22:25:32,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2022-07-19 22:25:32,716 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:25:32,716 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-19 22:25:32,742 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-19 22:25:32,939 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-19 22:25:32,940 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:25:32,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:25:32,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1005655303, now seen corresponding path program 1 times [2022-07-19 22:25:32,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:25:32,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217743260] [2022-07-19 22:25:32,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:25:32,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:25:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 22:25:34,046 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 22:25:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 22:25:36,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 22:25:36,583 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 22:25:36,584 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 22:25:36,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-19 22:25:36,587 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-19 22:25:36,592 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 22:25:36,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:25:36 BoogieIcfgContainer [2022-07-19 22:25:36,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 22:25:36,794 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 22:25:36,794 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 22:25:36,794 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 22:25:36,795 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:24:29" (3/4) ... [2022-07-19 22:25:36,797 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-19 22:25:36,797 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 22:25:36,797 INFO L158 Benchmark]: Toolchain (without parser) took 70505.56ms. Allocated memory was 104.9MB in the beginning and 916.5MB in the end (delta: 811.6MB). Free memory was 61.7MB in the beginning and 497.7MB in the end (delta: -436.1MB). Peak memory consumption was 378.3MB. Max. memory is 16.1GB. [2022-07-19 22:25:36,798 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory was 58.1MB in the beginning and 58.1MB in the end (delta: 42.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 22:25:36,801 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1328.75ms. Allocated memory was 104.9MB in the beginning and 172.0MB in the end (delta: 67.1MB). Free memory was 61.5MB in the beginning and 76.0MB in the end (delta: -14.5MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2022-07-19 22:25:36,801 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.34ms. Allocated memory is still 172.0MB. Free memory was 76.0MB in the beginning and 64.4MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 22:25:36,801 INFO L158 Benchmark]: Boogie Preprocessor took 127.29ms. Allocated memory is still 172.0MB. Free memory was 64.4MB in the beginning and 111.3MB in the end (delta: -46.9MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2022-07-19 22:25:36,802 INFO L158 Benchmark]: RCFGBuilder took 1847.28ms. Allocated memory was 172.0MB in the beginning and 209.7MB in the end (delta: 37.7MB). Free memory was 111.3MB in the beginning and 131.9MB in the end (delta: -20.7MB). Peak memory consumption was 87.3MB. Max. memory is 16.1GB. [2022-07-19 22:25:36,802 INFO L158 Benchmark]: TraceAbstraction took 67083.94ms. Allocated memory was 209.7MB in the beginning and 916.5MB in the end (delta: 706.7MB). Free memory was 130.9MB in the beginning and 497.7MB in the end (delta: -366.8MB). Peak memory consumption was 540.2MB. Max. memory is 16.1GB. [2022-07-19 22:25:36,802 INFO L158 Benchmark]: Witness Printer took 3.19ms. Allocated memory is still 916.5MB. Free memory is still 497.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 22:25:36,806 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory was 58.1MB in the beginning and 58.1MB in the end (delta: 42.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1328.75ms. Allocated memory was 104.9MB in the beginning and 172.0MB in the end (delta: 67.1MB). Free memory was 61.5MB in the beginning and 76.0MB in the end (delta: -14.5MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.34ms. Allocated memory is still 172.0MB. Free memory was 76.0MB in the beginning and 64.4MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 127.29ms. Allocated memory is still 172.0MB. Free memory was 64.4MB in the beginning and 111.3MB in the end (delta: -46.9MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1847.28ms. Allocated memory was 172.0MB in the beginning and 209.7MB in the end (delta: 37.7MB). Free memory was 111.3MB in the beginning and 131.9MB in the end (delta: -20.7MB). Peak memory consumption was 87.3MB. Max. memory is 16.1GB. * TraceAbstraction took 67083.94ms. Allocated memory was 209.7MB in the beginning and 916.5MB in the end (delta: 706.7MB). Free memory was 130.9MB in the beginning and 497.7MB in the end (delta: -366.8MB). Peak memory consumption was 540.2MB. Max. memory is 16.1GB. * Witness Printer took 3.19ms. Allocated memory is still 916.5MB. Free memory is still 497.7MB. 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.8s, OverallIterations: 22, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 41.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17887 SdHoareTripleChecker+Valid, 38.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16786 mSDsluCounter, 70143 SdHoareTripleChecker+Invalid, 35.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1633 IncrementalHoareTripleChecker+Unchecked, 54105 mSDsCounter, 7806 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30824 IncrementalHoareTripleChecker+Invalid, 40263 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7806 mSolverCounterUnsat, 16038 mSDtfsCounter, 30824 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4774 GetRequests, 4441 SyntacticMatches, 27 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2105occurred in iteration=16, InterpolantAutomatonStates: 229, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 368 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 4.6s SatisfiabilityAnalysisTime, 8.3s 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-19 22:25:36,847 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-?-eb692b5 [2022-07-19 22:25:38,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 22:25:38,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 22:25:38,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 22:25:38,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 22:25:38,671 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 22:25:38,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 22:25:38,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 22:25:38,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 22:25:38,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 22:25:38,682 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 22:25:38,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 22:25:38,686 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 22:25:38,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 22:25:38,688 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 22:25:38,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 22:25:38,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 22:25:38,691 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 22:25:38,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 22:25:38,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 22:25:38,698 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 22:25:38,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 22:25:38,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 22:25:38,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 22:25:38,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 22:25:38,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 22:25:38,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 22:25:38,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 22:25:38,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 22:25:38,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 22:25:38,708 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 22:25:38,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 22:25:38,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 22:25:38,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 22:25:38,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 22:25:38,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 22:25:38,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 22:25:38,714 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 22:25:38,714 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 22:25:38,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 22:25:38,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 22:25:38,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 22:25:38,719 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-19 22:25:38,743 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 22:25:38,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 22:25:38,744 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 22:25:38,744 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 22:25:38,745 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 22:25:38,745 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 22:25:38,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 22:25:38,746 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 22:25:38,746 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 22:25:38,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 22:25:38,747 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 22:25:38,747 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 22:25:38,747 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 22:25:38,754 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 22:25:38,755 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 22:25:38,755 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 22:25:38,755 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 22:25:38,755 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 22:25:38,755 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 22:25:38,756 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 22:25:38,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 22:25:38,756 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 22:25:38,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 22:25:38,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:25:38,757 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 22:25:38,757 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 22:25:38,757 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 22:25:38,757 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 22:25:38,757 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 22:25:38,757 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 22:25:38,758 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 22:25:38,758 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 22:25:38,758 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 22:25:38,758 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c [2022-07-19 22:25:39,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 22:25:39,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 22:25:39,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 22:25:39,052 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 22:25:39,052 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 22:25:39,053 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-19 22:25:39,094 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4e7d4177/50fb1bd47ea048818078dc9ccd48b78f/FLAG6abb77863 [2022-07-19 22:25:39,613 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 22:25:39,613 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-19 22:25:39,649 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4e7d4177/50fb1bd47ea048818078dc9ccd48b78f/FLAG6abb77863 [2022-07-19 22:25:39,835 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4e7d4177/50fb1bd47ea048818078dc9ccd48b78f [2022-07-19 22:25:39,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 22:25:39,837 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 22:25:39,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 22:25:39,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 22:25:39,842 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 22:25:39,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:25:39" (1/1) ... [2022-07-19 22:25:39,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c9f128f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:25:39, skipping insertion in model container [2022-07-19 22:25:39,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:25:39" (1/1) ... [2022-07-19 22:25:39,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 22:25:39,923 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 22:25:40,745 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-19 22:25:40,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:25:40,857 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-19 22:25:40,880 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 22:25:41,024 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-19 22:25:41,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:25:41,059 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 22:25:41,212 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-19 22:25:41,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:25:41,386 INFO L208 MainTranslator]: Completed translation [2022-07-19 22:25:41,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:25:41 WrapperNode [2022-07-19 22:25:41,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 22:25:41,388 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 22:25:41,388 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 22:25:41,388 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 22:25:41,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:25:41" (1/1) ... [2022-07-19 22:25:41,443 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:25:41" (1/1) ... [2022-07-19 22:25:41,507 INFO L137 Inliner]: procedures = 157, calls = 839, calls flagged for inlining = 59, calls inlined = 40, statements flattened = 1605 [2022-07-19 22:25:41,508 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 22:25:41,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 22:25:41,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 22:25:41,508 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 22:25:41,514 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:25:41" (1/1) ... [2022-07-19 22:25:41,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:25:41" (1/1) ... [2022-07-19 22:25:41,524 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:25:41" (1/1) ... [2022-07-19 22:25:41,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:25:41" (1/1) ... [2022-07-19 22:25:41,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:25:41" (1/1) ... [2022-07-19 22:25:41,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:25:41" (1/1) ... [2022-07-19 22:25:41,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:25:41" (1/1) ... [2022-07-19 22:25:41,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 22:25:41,627 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 22:25:41,627 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 22:25:41,627 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 22:25:41,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:25:41" (1/1) ... [2022-07-19 22:25:41,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:25:41,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:25:41,729 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-19 22:25:41,768 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-19 22:25:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-19 22:25:41,782 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-19 22:25:41,782 INFO L130 BoogieDeclarations]: Found specification of procedure catc_tx_run [2022-07-19 22:25:41,782 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_tx_run [2022-07-19 22:25:41,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-19 22:25:41,782 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-19 22:25:41,782 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-19 22:25:41,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-07-19 22:25:41,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-19 22:25:41,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-19 22:25:41,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2022-07-19 22:25:41,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-19 22:25:41,783 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-19 22:25:41,783 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-19 22:25:41,783 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-19 22:25:41,783 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-19 22:25:41,783 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_run [2022-07-19 22:25:41,783 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_run [2022-07-19 22:25:41,783 INFO L130 BoogieDeclarations]: Found specification of procedure catc_get_drvinfo [2022-07-19 22:25:41,783 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_get_drvinfo [2022-07-19 22:25:41,783 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_msg [2022-07-19 22:25:41,784 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_msg [2022-07-19 22:25:41,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-19 22:25:41,784 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-19 22:25:41,784 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-19 22:25:41,784 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-19 22:25:41,784 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-19 22:25:41,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-19 22:25:41,784 INFO L130 BoogieDeclarations]: Found specification of procedure catc_multicast [2022-07-19 22:25:41,784 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_multicast [2022-07-19 22:25:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-19 22:25:41,785 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-19 22:25:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-19 22:25:41,785 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-19 22:25:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-07-19 22:25:41,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-07-19 22:25:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2022-07-19 22:25:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2022-07-19 22:25:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2022-07-19 22:25:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2022-07-19 22:25:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-19 22:25:41,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-19 22:25:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-19 22:25:41,787 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-19 22:25:41,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-19 22:25:41,787 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-19 22:25:41,787 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-19 22:25:41,787 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-19 22:25:41,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 22:25:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure crc32_le [2022-07-19 22:25:41,788 INFO L138 BoogieDeclarations]: Found implementation of procedure crc32_le [2022-07-19 22:25:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-19 22:25:41,789 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-19 22:25:41,789 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-19 22:25:41,789 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-19 22:25:41,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 22:25:41,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 22:25:41,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 22:25:41,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2022-07-19 22:25:41,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2022-07-19 22:25:41,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2022-07-19 22:25:41,790 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_async [2022-07-19 22:25:41,790 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_async [2022-07-19 22:25:41,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 22:25:41,790 INFO L130 BoogieDeclarations]: Found specification of procedure catc_exit [2022-07-19 22:25:41,791 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_exit [2022-07-19 22:25:41,791 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-19 22:25:41,791 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-19 22:25:41,791 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-19 22:25:41,791 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-19 22:25:41,792 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-19 22:25:41,792 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-19 22:25:41,792 INFO L130 BoogieDeclarations]: Found specification of procedure catc_init [2022-07-19 22:25:41,792 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_init [2022-07-19 22:25:41,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-07-19 22:25:41,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-19 22:25:41,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-07-19 22:25:41,792 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-19 22:25:41,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-19 22:25:41,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 22:25:41,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-19 22:25:41,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 22:25:41,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2022-07-19 22:25:41,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 22:25:41,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-07-19 22:25:41,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-07-19 22:25:41,794 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-19 22:25:41,794 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-19 22:25:41,794 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-07-19 22:25:41,794 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-07-19 22:25:41,795 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-19 22:25:41,795 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-19 22:25:41,795 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-19 22:25:41,795 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-19 22:25:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-19 22:25:41,796 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-19 22:25:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-07-19 22:25:41,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-07-19 22:25:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2022-07-19 22:25:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-19 22:25:41,796 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-19 22:25:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-07-19 22:25:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 22:25:41,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 22:25:42,184 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 22:25:42,185 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 22:25:53,180 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-07-19 22:25:53,309 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 22:25:53,316 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 22:26:05,487 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2022-07-19 22:26:05,488 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2022-07-19 22:26:05,488 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-07-19 22:26:05,488 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-07-19 22:26:05,506 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 22:26:05,513 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 22:26:05,514 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-07-19 22:26:05,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:26:05 BoogieIcfgContainer [2022-07-19 22:26:05,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 22:26:05,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 22:26:05,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 22:26:05,519 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 22:26:05,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:25:39" (1/3) ... [2022-07-19 22:26:05,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582ed3f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:26:05, skipping insertion in model container [2022-07-19 22:26:05,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:25:41" (2/3) ... [2022-07-19 22:26:05,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582ed3f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:26:05, skipping insertion in model container [2022-07-19 22:26:05,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:26:05" (3/3) ... [2022-07-19 22:26:05,521 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-07-19 22:26:05,531 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 22:26:05,531 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 22:26:05,571 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 22:26:05,576 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@24e9b81, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2d727920 [2022-07-19 22:26:05,576 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 22:26:05,590 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-19 22:26:05,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-19 22:26:05,598 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:26:05,599 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:26:05,599 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:26:05,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:26:05,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1343427639, now seen corresponding path program 1 times [2022-07-19 22:26:05,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 22:26:05,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478041789] [2022-07-19 22:26:05,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:26:05,615 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 22:26:05,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 22:26:05,633 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-19 22:26:05,634 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-19 22:26:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:26:06,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 22:26:06,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:26:06,304 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-19 22:26:06,304 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:26:06,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 22:26:06,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478041789] [2022-07-19 22:26:06,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478041789] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:26:06,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:26:06,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 22:26:06,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674373924] [2022-07-19 22:26:06,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:26:06,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 22:26:06,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 22:26:06,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 22:26:06,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 22:26:06,353 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-19 22:26:06,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:26:06,517 INFO L93 Difference]: Finished difference Result 1076 states and 1560 transitions. [2022-07-19 22:26:06,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 22:26:06,532 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-19 22:26:06,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:26:06,547 INFO L225 Difference]: With dead ends: 1076 [2022-07-19 22:26:06,547 INFO L226 Difference]: Without dead ends: 540 [2022-07-19 22:26:06,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 22:26:06,557 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-19 22:26:06,559 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-19 22:26:06,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-07-19 22:26:06,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 535. [2022-07-19 22:26:06,619 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-19 22:26:06,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 700 transitions. [2022-07-19 22:26:06,625 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 700 transitions. Word has length 17 [2022-07-19 22:26:06,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:26:06,626 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 700 transitions. [2022-07-19 22:26:06,626 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-19 22:26:06,626 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 700 transitions. [2022-07-19 22:26:06,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-19 22:26:06,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:26:06,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:26:06,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-19 22:26:06,844 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-19 22:26:06,844 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:26:06,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:26:06,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1736454649, now seen corresponding path program 1 times [2022-07-19 22:26:06,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 22:26:06,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277590998] [2022-07-19 22:26:06,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:26:06,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 22:26:06,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 22:26:06,847 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-19 22:26:06,849 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-19 22:26:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:26:07,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 22:26:07,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:26:07,366 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-19 22:26:07,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:26:07,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 22:26:07,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277590998] [2022-07-19 22:26:07,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [277590998] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:26:07,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:26:07,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 22:26:07,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778804532] [2022-07-19 22:26:07,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:26:07,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 22:26:07,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 22:26:07,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 22:26:07,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 22:26:07,368 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-19 22:26:07,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:26:07,431 INFO L93 Difference]: Finished difference Result 1565 states and 2072 transitions. [2022-07-19 22:26:07,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 22:26:07,432 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-19 22:26:07,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:26:07,436 INFO L225 Difference]: With dead ends: 1565 [2022-07-19 22:26:07,436 INFO L226 Difference]: Without dead ends: 1048 [2022-07-19 22:26:07,438 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-19 22:26:07,439 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-19 22:26:07,439 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-19 22:26:07,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2022-07-19 22:26:07,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1045. [2022-07-19 22:26:07,470 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-19 22:26:07,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1376 transitions. [2022-07-19 22:26:07,476 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1376 transitions. Word has length 17 [2022-07-19 22:26:07,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:26:07,477 INFO L495 AbstractCegarLoop]: Abstraction has 1045 states and 1376 transitions. [2022-07-19 22:26:07,477 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-19 22:26:07,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1376 transitions. [2022-07-19 22:26:07,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 22:26:07,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:26:07,478 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-19 22:26:07,496 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-19 22:26:07,694 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-19 22:26:07,694 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:26:07,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:26:07,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2004221234, now seen corresponding path program 1 times [2022-07-19 22:26:07,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 22:26:07,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588372724] [2022-07-19 22:26:07,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:26:07,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 22:26:07,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 22:26:07,712 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-19 22:26:07,714 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-19 22:26:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:26:08,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 22:26:08,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:26:08,253 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-19 22:26:08,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:26:08,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 22:26:08,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588372724] [2022-07-19 22:26:08,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588372724] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:26:08,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:26:08,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 22:26:08,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130106982] [2022-07-19 22:26:08,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:26:08,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 22:26:08,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 22:26:08,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 22:26:08,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 22:26:08,255 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-19 22:26:08,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:26:08,274 INFO L93 Difference]: Finished difference Result 1047 states and 1377 transitions. [2022-07-19 22:26:08,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 22:26:08,275 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-19 22:26:08,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:26:08,279 INFO L225 Difference]: With dead ends: 1047 [2022-07-19 22:26:08,279 INFO L226 Difference]: Without dead ends: 1036 [2022-07-19 22:26:08,279 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-19 22:26:08,280 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-19 22:26:08,280 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-19 22:26:08,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2022-07-19 22:26:08,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1031. [2022-07-19 22:26:08,304 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-19 22:26:08,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1356 transitions. [2022-07-19 22:26:08,308 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1356 transitions. Word has length 18 [2022-07-19 22:26:08,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:26:08,309 INFO L495 AbstractCegarLoop]: Abstraction has 1031 states and 1356 transitions. [2022-07-19 22:26:08,309 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-19 22:26:08,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1356 transitions. [2022-07-19 22:26:08,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-19 22:26:08,311 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:26:08,311 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-19 22:26:08,328 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-19 22:26:08,526 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-19 22:26:08,526 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:26:08,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:26:08,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1305048404, now seen corresponding path program 1 times [2022-07-19 22:26:08,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 22:26:08,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723976147] [2022-07-19 22:26:08,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:26:08,527 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 22:26:08,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 22:26:08,530 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-19 22:26:08,541 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-19 22:26:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:26:08,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 22:26:09,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:26:09,074 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-19 22:26:09,074 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:26:09,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 22:26:09,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723976147] [2022-07-19 22:26:09,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723976147] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:26:09,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:26:09,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 22:26:09,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877805853] [2022-07-19 22:26:09,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:26:09,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 22:26:09,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 22:26:09,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 22:26:09,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 22:26:09,075 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-19 22:26:09,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:26:09,161 INFO L93 Difference]: Finished difference Result 2353 states and 3158 transitions. [2022-07-19 22:26:09,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 22:26:09,162 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-19 22:26:09,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:26:09,167 INFO L225 Difference]: With dead ends: 2353 [2022-07-19 22:26:09,167 INFO L226 Difference]: Without dead ends: 1334 [2022-07-19 22:26:09,169 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-19 22:26:09,169 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-19 22:26:09,170 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-19 22:26:09,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2022-07-19 22:26:09,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1330. [2022-07-19 22:26:09,197 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-19 22:26:09,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1804 transitions. [2022-07-19 22:26:09,206 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1804 transitions. Word has length 50 [2022-07-19 22:26:09,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:26:09,206 INFO L495 AbstractCegarLoop]: Abstraction has 1330 states and 1804 transitions. [2022-07-19 22:26:09,207 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-19 22:26:09,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1804 transitions. [2022-07-19 22:26:09,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-19 22:26:09,223 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:26:09,223 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-19 22:26:09,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-19 22:26:09,440 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-19 22:26:09,440 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:26:09,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:26:09,441 INFO L85 PathProgramCache]: Analyzing trace with hash -518166049, now seen corresponding path program 1 times [2022-07-19 22:26:09,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 22:26:09,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415256294] [2022-07-19 22:26:09,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:26:09,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 22:26:09,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 22:26:09,443 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-19 22:26:09,445 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-19 22:26:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:26:09,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 22:26:09,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:26:09,977 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-19 22:26:09,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:26:09,977 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 22:26:09,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415256294] [2022-07-19 22:26:09,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415256294] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:26:09,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:26:09,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 22:26:09,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110613923] [2022-07-19 22:26:09,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:26:09,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 22:26:09,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 22:26:09,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 22:26:09,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 22:26:09,978 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-19 22:26:10,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:26:10,183 INFO L93 Difference]: Finished difference Result 2669 states and 3616 transitions. [2022-07-19 22:26:10,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:26:10,184 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-19 22:26:10,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:26:10,189 INFO L225 Difference]: With dead ends: 2669 [2022-07-19 22:26:10,189 INFO L226 Difference]: Without dead ends: 1343 [2022-07-19 22:26:10,196 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-19 22:26:10,197 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.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:26:10,197 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.2s Time] [2022-07-19 22:26:10,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2022-07-19 22:26:10,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1333. [2022-07-19 22:26:10,256 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-19 22:26:10,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1804 transitions. [2022-07-19 22:26:10,261 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1804 transitions. Word has length 72 [2022-07-19 22:26:10,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:26:10,262 INFO L495 AbstractCegarLoop]: Abstraction has 1333 states and 1804 transitions. [2022-07-19 22:26:10,262 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-19 22:26:10,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1804 transitions. [2022-07-19 22:26:10,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-19 22:26:10,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:26:10,265 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-19 22:26:10,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-19 22:26:10,479 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-19 22:26:10,479 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:26:10,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:26:10,480 INFO L85 PathProgramCache]: Analyzing trace with hash -84772232, now seen corresponding path program 1 times [2022-07-19 22:26:10,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 22:26:10,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899097461] [2022-07-19 22:26:10,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:26:10,482 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 22:26:10,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 22:26:10,483 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-19 22:26:10,506 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-19 22:26:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:26:11,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 22:26:11,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:26:11,085 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-19 22:26:11,086 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:26:11,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 22:26:11,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1899097461] [2022-07-19 22:26:11,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1899097461] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:26:11,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:26:11,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 22:26:11,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270790728] [2022-07-19 22:26:11,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:26:11,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 22:26:11,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 22:26:11,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 22:26:11,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 22:26:11,088 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-19 22:26:11,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:26:11,273 INFO L93 Difference]: Finished difference Result 2675 states and 3616 transitions. [2022-07-19 22:26:11,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:26:11,274 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-19 22:26:11,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:26:11,279 INFO L225 Difference]: With dead ends: 2675 [2022-07-19 22:26:11,280 INFO L226 Difference]: Without dead ends: 1346 [2022-07-19 22:26:11,283 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-19 22:26:11,284 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-19 22:26:11,284 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-19 22:26:11,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2022-07-19 22:26:11,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1330. [2022-07-19 22:26:11,310 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-19 22:26:11,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1798 transitions. [2022-07-19 22:26:11,343 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1798 transitions. Word has length 80 [2022-07-19 22:26:11,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:26:11,343 INFO L495 AbstractCegarLoop]: Abstraction has 1330 states and 1798 transitions. [2022-07-19 22:26:11,344 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-19 22:26:11,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1798 transitions. [2022-07-19 22:26:11,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-19 22:26:11,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:26:11,349 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-19 22:26:11,365 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-19 22:26:11,565 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-19 22:26:11,565 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:26:11,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:26:11,566 INFO L85 PathProgramCache]: Analyzing trace with hash -2140419496, now seen corresponding path program 1 times [2022-07-19 22:26:11,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 22:26:11,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30413454] [2022-07-19 22:26:11,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:26:11,567 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 22:26:11,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 22:26:11,568 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-19 22:26:11,569 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-19 22:26:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:26:12,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 22:26:12,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:26:12,303 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-19 22:26:12,305 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:26:12,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 22:26:12,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30413454] [2022-07-19 22:26:12,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30413454] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:26:12,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:26:12,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 22:26:12,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527939901] [2022-07-19 22:26:12,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:26:12,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 22:26:12,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 22:26:12,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 22:26:12,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 22:26:12,307 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-19 22:26:13,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:26:13,046 INFO L93 Difference]: Finished difference Result 2671 states and 3615 transitions. [2022-07-19 22:26:13,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 22:26:13,047 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-19 22:26:13,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:26:13,052 INFO L225 Difference]: With dead ends: 2671 [2022-07-19 22:26:13,052 INFO L226 Difference]: Without dead ends: 1351 [2022-07-19 22:26:13,058 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-19 22:26:13,060 INFO L413 NwaCegarLoop]: 702 mSDtfsCounter, 13 mSDsluCounter, 2777 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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-19 22:26:13,060 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-19 22:26:13,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2022-07-19 22:26:13,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1337. [2022-07-19 22:26:13,099 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-19 22:26:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1808 transitions. [2022-07-19 22:26:13,104 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1808 transitions. Word has length 146 [2022-07-19 22:26:13,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:26:13,106 INFO L495 AbstractCegarLoop]: Abstraction has 1337 states and 1808 transitions. [2022-07-19 22:26:13,106 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-19 22:26:13,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1808 transitions. [2022-07-19 22:26:13,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-19 22:26:13,107 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:26:13,108 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-19 22:26:13,132 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-19 22:26:13,321 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-19 22:26:13,322 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:26:13,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:26:13,322 INFO L85 PathProgramCache]: Analyzing trace with hash 971530265, now seen corresponding path program 1 times [2022-07-19 22:26:13,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 22:26:13,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115388878] [2022-07-19 22:26:13,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:26:13,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 22:26:13,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 22:26:13,325 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-19 22:26:13,326 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-19 22:26:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:26:14,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 22:26:14,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:26:14,125 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-19 22:26:14,130 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-19 22:26:14,229 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-19 22:26:14,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:26:14,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 22:26:14,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [115388878] [2022-07-19 22:26:14,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [115388878] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:26:14,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:26:14,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 22:26:14,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139662129] [2022-07-19 22:26:14,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:26:14,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:26:14,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 22:26:14,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:26:14,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 22:26:14,231 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-19 22:26:16,385 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-19 22:26:18,398 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-19 22:26:20,451 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-19 22:26:22,470 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-19 22:26:24,516 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-19 22:26:26,534 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-19 22:26:28,588 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-19 22:26:30,605 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-19 22:26:32,839 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-19 22:26:34,849 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-19 22:26:38,620 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-19 22:26:41,435 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:26:43,449 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-19 22:26:45,646 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:26:47,663 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-19 22:26:49,725 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:26:51,292 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:26:53,371 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-19 22:26:55,385 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-19 22:26:56,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:26:56,197 INFO L93 Difference]: Finished difference Result 1399 states and 1888 transitions. [2022-07-19 22:26:56,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:26:56,198 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-19 22:26:56,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:26:56,204 INFO L225 Difference]: With dead ends: 1399 [2022-07-19 22:26:56,204 INFO L226 Difference]: Without dead ends: 1339 [2022-07-19 22:26:56,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:26:56,205 INFO L413 NwaCegarLoop]: 687 mSDtfsCounter, 4 mSDsluCounter, 3176 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 1 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3863 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.8s IncrementalHoareTripleChecker+Time [2022-07-19 22:26:56,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3863 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 265 Invalid, 15 Unknown, 0 Unchecked, 41.8s Time] [2022-07-19 22:26:56,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2022-07-19 22:26:56,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2022-07-19 22:26:56,248 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-19 22:26:56,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1806 transitions. [2022-07-19 22:26:56,252 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1806 transitions. Word has length 146 [2022-07-19 22:26:56,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:26:56,252 INFO L495 AbstractCegarLoop]: Abstraction has 1337 states and 1806 transitions. [2022-07-19 22:26:56,253 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-19 22:26:56,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1806 transitions. [2022-07-19 22:26:56,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-19 22:26:56,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:26:56,254 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-19 22:26:56,280 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-19 22:26:56,469 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-19 22:26:56,469 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:26:56,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:26:56,469 INFO L85 PathProgramCache]: Analyzing trace with hash -480950281, now seen corresponding path program 1 times [2022-07-19 22:26:56,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 22:26:56,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [869101466] [2022-07-19 22:26:56,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:26:56,470 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 22:26:56,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 22:26:56,471 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-19 22:26:56,472 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-19 22:27:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:27:01,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-19 22:27:01,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:27:01,592 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-19 22:27:01,603 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-19 22:27:02,014 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-19 22:27:02,014 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-19 22:27:02,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:27:02,032 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-19 22:27:02,399 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-19 22:27:02,400 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-19 22:27:02,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:27:02,415 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-19 22:27:02,703 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-19 22:27:02,707 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-19 22:27:02,740 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-19 22:27:02,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:27:02,950 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-19 22:27:02,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 22:27:02,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [869101466] [2022-07-19 22:27:02,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [869101466] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:27:02,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:27:02,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2022-07-19 22:27:02,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360835107] [2022-07-19 22:27:02,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:27:02,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:27:02,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 22:27:02,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:27:02,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 22:27:02,952 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-19 22:27:04,517 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:27:06,576 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-19 22:27:08,621 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-19 22:27:10,665 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-19 22:27:12,801 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-19 22:27:15,226 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:27:17,254 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-19 22:27:19,295 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:27:21,561 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-19 22:27:22,935 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:27:24,673 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:27:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:27:25,104 INFO L93 Difference]: Finished difference Result 2386 states and 3197 transitions. [2022-07-19 22:27:25,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:27:25,105 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-19 22:27:25,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:27:25,109 INFO L225 Difference]: With dead ends: 2386 [2022-07-19 22:27:25,109 INFO L226 Difference]: Without dead ends: 1008 [2022-07-19 22:27:25,113 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-19 22:27:25,113 INFO L413 NwaCegarLoop]: 702 mSDtfsCounter, 2 mSDsluCounter, 3272 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3974 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 22.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:27:25,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3974 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 7 Unknown, 101 Unchecked, 22.0s Time] [2022-07-19 22:27:25,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2022-07-19 22:27:25,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 1008. [2022-07-19 22:27:25,137 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-19 22:27:25,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1336 transitions. [2022-07-19 22:27:25,140 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1336 transitions. Word has length 147 [2022-07-19 22:27:25,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:27:25,140 INFO L495 AbstractCegarLoop]: Abstraction has 1008 states and 1336 transitions. [2022-07-19 22:27:25,141 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-19 22:27:25,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1336 transitions. [2022-07-19 22:27:25,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-19 22:27:25,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:27:25,142 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-19 22:27:25,171 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-19 22:27:25,367 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-19 22:27:25,367 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:27:25,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:27:25,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1300549654, now seen corresponding path program 1 times [2022-07-19 22:27:25,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 22:27:25,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56474523] [2022-07-19 22:27:25,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:27:25,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 22:27:25,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 22:27:25,370 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-19 22:27:25,371 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-19 22:27:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:27:26,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-19 22:27:26,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:27:26,264 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-19 22:27:26,264 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:27:26,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 22:27:26,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56474523] [2022-07-19 22:27:26,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56474523] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:27:26,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:27:26,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 22:27:26,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701583619] [2022-07-19 22:27:26,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:27:26,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:27:26,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 22:27:26,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:27:26,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 22:27:26,266 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-19 22:27:26,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:27:26,396 INFO L93 Difference]: Finished difference Result 1696 states and 2271 transitions. [2022-07-19 22:27:26,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 22:27:26,397 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-19 22:27:26,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:27:26,403 INFO L225 Difference]: With dead ends: 1696 [2022-07-19 22:27:26,403 INFO L226 Difference]: Without dead ends: 1011 [2022-07-19 22:27:26,405 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-19 22:27:26,405 INFO L413 NwaCegarLoop]: 689 mSDtfsCounter, 2 mSDsluCounter, 3436 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-19 22:27:26,406 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-19 22:27:26,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2022-07-19 22:27:26,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2022-07-19 22:27:26,429 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-19 22:27:26,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1338 transitions. [2022-07-19 22:27:26,432 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1338 transitions. Word has length 147 [2022-07-19 22:27:26,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:27:26,432 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 1338 transitions. [2022-07-19 22:27:26,432 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-19 22:27:26,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1338 transitions. [2022-07-19 22:27:26,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-19 22:27:26,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:27:26,434 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-19 22:27:26,458 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-19 22:27:26,658 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-19 22:27:26,658 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:27:26,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:27:26,658 INFO L85 PathProgramCache]: Analyzing trace with hash 345028375, now seen corresponding path program 2 times [2022-07-19 22:27:26,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 22:27:26,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243188994] [2022-07-19 22:27:26,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 22:27:26,659 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 22:27:26,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 22:27:26,660 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-19 22:27:26,662 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-19 22:27:28,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 22:27:28,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 22:27:28,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-19 22:27:28,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:27:28,919 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-19 22:27:28,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:27:29,841 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-19 22:27:29,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 22:27:29,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243188994] [2022-07-19 22:27:29,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1243188994] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:27:29,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:27:29,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2022-07-19 22:27:29,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383635847] [2022-07-19 22:27:29,842 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:27:29,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 22:27:29,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 22:27:29,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 22:27:29,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:27:29,844 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-19 22:27:32,232 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-19 22:27:34,315 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-19 22:27:36,538 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-19 22:27:38,949 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:27:41,022 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-19 22:27:43,036 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-19 22:27:45,046 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-19 22:27:47,098 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:27:49,120 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-19 22:27:51,133 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-19 22:27:53,208 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-19 22:27:55,424 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:27:57,441 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-19 22:27:59,299 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:28:02,180 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-19 22:28:05,853 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-19 22:28:07,866 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-19 22:28:09,878 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-19 22:28:12,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-19 22:28:14,078 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-19 22:28:16,094 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-19 22:28:19,011 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-19 22:28:21,021 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-19 22:28:23,038 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-19 22:28:25,097 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-19 22:28:27,109 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-19 22:28:29,119 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-19 22:28:31,494 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-19 22:28:33,505 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-19 22:28:35,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-19 22:28:37,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 []