./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-linux-3.0/usb_urb-drivers-hid-usbhid-usbmouse.ko_false-unreach-call.cil.out.i.pp.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 96530338 Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/ldv-linux-3.0/usb_urb-drivers-hid-usbhid-usbmouse.ko_false-unreach-call.cil.out.i.pp.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1259db070705cc8318f4cd544a981db9ba453479 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/ldv-linux-3.0/usb_urb-drivers-hid-usbhid-usbmouse.ko_false-unreach-call.cil.out.i.pp.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1259db070705cc8318f4cd544a981db9ba453479 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-9653033 [2018-11-26 13:13:47,078 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-26 13:13:47,080 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-26 13:13:47,091 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-26 13:13:47,091 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-26 13:13:47,092 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-26 13:13:47,094 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-26 13:13:47,095 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-26 13:13:47,097 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-26 13:13:47,098 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-26 13:13:47,099 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-26 13:13:47,099 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-26 13:13:47,100 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-26 13:13:47,101 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-26 13:13:47,102 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-26 13:13:47,103 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-26 13:13:47,104 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-26 13:13:47,106 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-26 13:13:47,108 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-26 13:13:47,110 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-26 13:13:47,111 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-26 13:13:47,112 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-26 13:13:47,115 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-26 13:13:47,115 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-26 13:13:47,115 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-26 13:13:47,116 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-26 13:13:47,117 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-26 13:13:47,118 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-26 13:13:47,119 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-26 13:13:47,120 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-26 13:13:47,120 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-26 13:13:47,121 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-26 13:13:47,121 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-26 13:13:47,121 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-26 13:13:47,122 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-26 13:13:47,123 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-26 13:13:47,123 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-26 13:13:47,138 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-26 13:13:47,138 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-26 13:13:47,139 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-26 13:13:47,139 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-26 13:13:47,140 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-26 13:13:47,140 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-26 13:13:47,140 INFO L133 SettingsManager]: * Use SBE=true [2018-11-26 13:13:47,140 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-26 13:13:47,141 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-26 13:13:47,141 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-26 13:13:47,141 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-26 13:13:47,141 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-26 13:13:47,141 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-26 13:13:47,141 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-26 13:13:47,142 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-26 13:13:47,142 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-26 13:13:47,142 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-26 13:13:47,142 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-26 13:13:47,142 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-26 13:13:47,142 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-26 13:13:47,143 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-26 13:13:47,143 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-26 13:13:47,143 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-26 13:13:47,143 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-26 13:13:47,143 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-26 13:13:47,144 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-26 13:13:47,144 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-26 13:13:47,144 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-26 13:13:47,144 INFO L133 SettingsManager]: * To the following directory=dump/ 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(__VERIFIER_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 -> 1259db070705cc8318f4cd544a981db9ba453479 [2018-11-26 13:13:47,189 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-26 13:13:47,200 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-26 13:13:47,204 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-26 13:13:47,205 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-26 13:13:47,205 INFO L276 PluginConnector]: CDTParser initialized [2018-11-26 13:13:47,206 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-3.0/usb_urb-drivers-hid-usbhid-usbmouse.ko_false-unreach-call.cil.out.i.pp.i [2018-11-26 13:13:47,258 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/878a031e9/7c01cbde2d9f4f038813f3635f1d4ba9/FLAGf9188215a [2018-11-26 13:13:47,798 INFO L307 CDTParser]: Found 1 translation units. [2018-11-26 13:13:47,799 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.0/usb_urb-drivers-hid-usbhid-usbmouse.ko_false-unreach-call.cil.out.i.pp.i [2018-11-26 13:13:47,824 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/878a031e9/7c01cbde2d9f4f038813f3635f1d4ba9/FLAGf9188215a [2018-11-26 13:13:48,229 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/878a031e9/7c01cbde2d9f4f038813f3635f1d4ba9 [2018-11-26 13:13:48,233 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-26 13:13:48,234 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-26 13:13:48,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-26 13:13:48,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-26 13:13:48,238 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-26 13:13:48,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:13:48" (1/1) ... [2018-11-26 13:13:48,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1358e0a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:13:48, skipping insertion in model container [2018-11-26 13:13:48,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:13:48" (1/1) ... [2018-11-26 13:13:48,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-26 13:13:48,323 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-26 13:13:49,015 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-26 13:13:49,041 INFO L191 MainTranslator]: Completed pre-run [2018-11-26 13:13:49,191 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-26 13:13:49,244 INFO L195 MainTranslator]: Completed translation [2018-11-26 13:13:49,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:13:49 WrapperNode [2018-11-26 13:13:49,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-26 13:13:49,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-26 13:13:49,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-26 13:13:49,246 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-26 13:13:49,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:13:49" (1/1) ... [2018-11-26 13:13:49,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:13:49" (1/1) ... [2018-11-26 13:13:49,295 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-26 13:13:49,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-26 13:13:49,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-26 13:13:49,296 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-26 13:13:49,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:13:49" (1/1) ... [2018-11-26 13:13:49,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:13:49" (1/1) ... [2018-11-26 13:13:49,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:13:49" (1/1) ... [2018-11-26 13:13:49,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:13:49" (1/1) ... [2018-11-26 13:13:49,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:13:49" (1/1) ... [2018-11-26 13:13:49,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:13:49" (1/1) ... [2018-11-26 13:13:49,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:13:49" (1/1) ... [2018-11-26 13:13:49,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-26 13:13:49,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-26 13:13:49,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-26 13:13:49,379 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-26 13:13:49,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:13:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-26 13:13:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2018-11-26 13:13:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2018-11-26 13:13:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-26 13:13:49,437 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-26 13:13:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2018-11-26 13:13:49,437 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2018-11-26 13:13:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-26 13:13:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2018-11-26 13:13:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-26 13:13:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2018-11-26 13:13:49,438 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2018-11-26 13:13:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-11-26 13:13:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-26 13:13:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2018-11-26 13:13:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2018-11-26 13:13:49,439 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2018-11-26 13:13:49,439 INFO L130 BoogieDeclarations]: Found specification of procedure usb_mouse_init [2018-11-26 13:13:49,439 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_mouse_init [2018-11-26 13:13:49,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-26 13:13:49,439 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_int [2018-11-26 13:13:49,439 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_int [2018-11-26 13:13:49,439 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2018-11-26 13:13:49,440 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2018-11-26 13:13:49,440 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2018-11-26 13:13:49,440 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2018-11-26 13:13:49,440 INFO L130 BoogieDeclarations]: Found specification of procedure usb_mouse_probe [2018-11-26 13:13:49,440 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_mouse_probe [2018-11-26 13:13:49,440 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2018-11-26 13:13:49,440 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2018-11-26 13:13:49,441 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2018-11-26 13:13:49,441 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2018-11-26 13:13:49,441 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2018-11-26 13:13:49,441 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2018-11-26 13:13:49,441 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2018-11-26 13:13:49,441 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2018-11-26 13:13:49,441 INFO L130 BoogieDeclarations]: Found specification of procedure usb_mouse_exit [2018-11-26 13:13:49,442 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_mouse_exit [2018-11-26 13:13:49,442 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2018-11-26 13:13:49,442 INFO L130 BoogieDeclarations]: Found specification of procedure usb_mouse_disconnect [2018-11-26 13:13:49,442 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_mouse_disconnect [2018-11-26 13:13:49,442 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2018-11-26 13:13:49,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2018-11-26 13:13:49,443 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2018-11-26 13:13:49,443 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2018-11-26 13:13:49,443 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2018-11-26 13:13:49,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-26 13:13:49,443 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2018-11-26 13:13:49,443 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2018-11-26 13:13:49,443 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2018-11-26 13:13:49,443 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2018-11-26 13:13:49,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-26 13:13:49,444 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2018-11-26 13:13:49,444 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2018-11-26 13:13:49,444 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2018-11-26 13:13:49,444 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2018-11-26 13:13:49,444 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2018-11-26 13:13:49,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2018-11-26 13:13:49,444 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2018-11-26 13:13:49,445 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2018-11-26 13:13:49,445 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2018-11-26 13:13:49,445 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2018-11-26 13:13:49,445 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_int_in [2018-11-26 13:13:49,445 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_int_in [2018-11-26 13:13:49,445 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2018-11-26 13:13:49,445 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2018-11-26 13:13:49,446 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2018-11-26 13:13:49,446 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2018-11-26 13:13:49,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-26 13:13:49,446 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2018-11-26 13:13:49,446 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2018-11-26 13:13:49,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-26 13:13:49,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-26 13:13:49,446 INFO L130 BoogieDeclarations]: Found specification of procedure usb_maxpacket [2018-11-26 13:13:49,447 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_maxpacket [2018-11-26 13:13:49,447 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2018-11-26 13:13:49,447 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2018-11-26 13:13:49,447 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-11-26 13:13:49,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-11-26 13:13:49,447 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2018-11-26 13:13:49,447 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2018-11-26 13:13:49,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-26 13:13:49,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-26 13:13:49,448 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2018-11-26 13:13:49,721 WARN L645 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-26 13:13:49,722 WARN L610 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-26 13:13:50,556 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-26 13:13:50,556 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-26 13:13:50,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:13:50 BoogieIcfgContainer [2018-11-26 13:13:50,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-26 13:13:50,558 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-26 13:13:50,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-26 13:13:50,562 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-26 13:13:50,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 01:13:48" (1/3) ... [2018-11-26 13:13:50,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782a0677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:13:50, skipping insertion in model container [2018-11-26 13:13:50,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:13:49" (2/3) ... [2018-11-26 13:13:50,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782a0677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:13:50, skipping insertion in model container [2018-11-26 13:13:50,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:13:50" (3/3) ... [2018-11-26 13:13:50,566 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-hid-usbhid-usbmouse.ko_false-unreach-call.cil.out.i.pp.i [2018-11-26 13:13:50,577 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-26 13:13:50,586 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-26 13:13:50,605 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-26 13:13:50,642 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-26 13:13:50,642 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-26 13:13:50,643 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-26 13:13:50,643 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-26 13:13:50,643 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-26 13:13:50,643 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-26 13:13:50,644 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-26 13:13:50,644 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-26 13:13:50,644 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-26 13:13:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states. [2018-11-26 13:13:50,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-26 13:13:50,678 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:50,679 INFO L402 BasicCegarLoop]: 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] [2018-11-26 13:13:50,681 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:50,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:50,687 INFO L82 PathProgramCache]: Analyzing trace with hash -736875403, now seen corresponding path program 1 times [2018-11-26 13:13:50,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:50,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:50,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:50,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:50,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:51,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:13:51,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:51,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:13:51,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:13:51,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:13:51,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:13:51,079 INFO L87 Difference]: Start difference. First operand 220 states. Second operand 6 states. [2018-11-26 13:13:51,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:51,221 INFO L93 Difference]: Finished difference Result 426 states and 553 transitions. [2018-11-26 13:13:51,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:13:51,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-26 13:13:51,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:51,239 INFO L225 Difference]: With dead ends: 426 [2018-11-26 13:13:51,240 INFO L226 Difference]: Without dead ends: 212 [2018-11-26 13:13:51,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:13:51,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-11-26 13:13:51,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2018-11-26 13:13:51,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-11-26 13:13:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 253 transitions. [2018-11-26 13:13:51,317 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 253 transitions. Word has length 23 [2018-11-26 13:13:51,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:51,317 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 253 transitions. [2018-11-26 13:13:51,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:13:51,318 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 253 transitions. [2018-11-26 13:13:51,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-26 13:13:51,319 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:51,319 INFO L402 BasicCegarLoop]: 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] [2018-11-26 13:13:51,320 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:51,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:51,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1129902413, now seen corresponding path program 1 times [2018-11-26 13:13:51,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:51,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:51,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:51,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:51,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:51,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:13:51,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:51,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-26 13:13:51,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-26 13:13:51,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-26 13:13:51,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-26 13:13:51,417 INFO L87 Difference]: Start difference. First operand 211 states and 253 transitions. Second operand 3 states. [2018-11-26 13:13:51,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:51,487 INFO L93 Difference]: Finished difference Result 581 states and 709 transitions. [2018-11-26 13:13:51,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-26 13:13:51,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-26 13:13:51,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:51,494 INFO L225 Difference]: With dead ends: 581 [2018-11-26 13:13:51,495 INFO L226 Difference]: Without dead ends: 394 [2018-11-26 13:13:51,497 INFO L631 BasicCegarLoop]: 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 [2018-11-26 13:13:51,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-11-26 13:13:51,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 390. [2018-11-26 13:13:51,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-11-26 13:13:51,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 473 transitions. [2018-11-26 13:13:51,537 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 473 transitions. Word has length 23 [2018-11-26 13:13:51,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:51,537 INFO L480 AbstractCegarLoop]: Abstraction has 390 states and 473 transitions. [2018-11-26 13:13:51,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-26 13:13:51,537 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 473 transitions. [2018-11-26 13:13:51,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-26 13:13:51,538 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:51,538 INFO L402 BasicCegarLoop]: 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] [2018-11-26 13:13:51,538 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:51,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:51,539 INFO L82 PathProgramCache]: Analyzing trace with hash -667381066, now seen corresponding path program 1 times [2018-11-26 13:13:51,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:51,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:51,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:51,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:51,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:51,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:13:51,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:51,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-26 13:13:51,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-26 13:13:51,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-26 13:13:51,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-26 13:13:51,602 INFO L87 Difference]: Start difference. First operand 390 states and 473 transitions. Second operand 3 states. [2018-11-26 13:13:51,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:51,666 INFO L93 Difference]: Finished difference Result 1119 states and 1378 transitions. [2018-11-26 13:13:51,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-26 13:13:51,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-26 13:13:51,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:51,672 INFO L225 Difference]: With dead ends: 1119 [2018-11-26 13:13:51,672 INFO L226 Difference]: Without dead ends: 746 [2018-11-26 13:13:51,675 INFO L631 BasicCegarLoop]: 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 [2018-11-26 13:13:51,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-11-26 13:13:51,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 734. [2018-11-26 13:13:51,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-11-26 13:13:51,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 898 transitions. [2018-11-26 13:13:51,726 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 898 transitions. Word has length 24 [2018-11-26 13:13:51,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:51,726 INFO L480 AbstractCegarLoop]: Abstraction has 734 states and 898 transitions. [2018-11-26 13:13:51,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-26 13:13:51,727 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 898 transitions. [2018-11-26 13:13:51,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-26 13:13:51,728 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:51,728 INFO L402 BasicCegarLoop]: 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] [2018-11-26 13:13:51,729 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:51,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:51,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1883917988, now seen corresponding path program 1 times [2018-11-26 13:13:51,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:51,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:51,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:51,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:51,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:51,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:13:51,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:51,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-26 13:13:51,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:13:51,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:13:51,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:51,817 INFO L87 Difference]: Start difference. First operand 734 states and 898 transitions. Second operand 5 states. [2018-11-26 13:13:51,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:51,993 INFO L93 Difference]: Finished difference Result 1567 states and 1957 transitions. [2018-11-26 13:13:51,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:13:51,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-11-26 13:13:51,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:51,999 INFO L225 Difference]: With dead ends: 1567 [2018-11-26 13:13:52,000 INFO L226 Difference]: Without dead ends: 850 [2018-11-26 13:13:52,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:13:52,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-11-26 13:13:52,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 805. [2018-11-26 13:13:52,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2018-11-26 13:13:52,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 999 transitions. [2018-11-26 13:13:52,046 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 999 transitions. Word has length 46 [2018-11-26 13:13:52,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:52,046 INFO L480 AbstractCegarLoop]: Abstraction has 805 states and 999 transitions. [2018-11-26 13:13:52,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:13:52,046 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 999 transitions. [2018-11-26 13:13:52,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-26 13:13:52,049 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:52,049 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-26 13:13:52,050 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:52,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:52,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1208995629, now seen corresponding path program 1 times [2018-11-26 13:13:52,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:52,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:52,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:52,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:52,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:52,151 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:13:52,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:52,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-26 13:13:52,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:13:52,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:13:52,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:52,153 INFO L87 Difference]: Start difference. First operand 805 states and 999 transitions. Second operand 5 states. [2018-11-26 13:13:52,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:52,245 INFO L93 Difference]: Finished difference Result 1630 states and 2020 transitions. [2018-11-26 13:13:52,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-26 13:13:52,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2018-11-26 13:13:52,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:52,250 INFO L225 Difference]: With dead ends: 1630 [2018-11-26 13:13:52,251 INFO L226 Difference]: Without dead ends: 840 [2018-11-26 13:13:52,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:52,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2018-11-26 13:13:52,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 817. [2018-11-26 13:13:52,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-11-26 13:13:52,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1009 transitions. [2018-11-26 13:13:52,319 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1009 transitions. Word has length 64 [2018-11-26 13:13:52,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:52,319 INFO L480 AbstractCegarLoop]: Abstraction has 817 states and 1009 transitions. [2018-11-26 13:13:52,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:13:52,319 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1009 transitions. [2018-11-26 13:13:52,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-26 13:13:52,322 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:52,323 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-26 13:13:52,323 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:52,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:52,323 INFO L82 PathProgramCache]: Analyzing trace with hash -335293934, now seen corresponding path program 1 times [2018-11-26 13:13:52,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:52,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:52,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:52,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:52,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:52,423 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-26 13:13:52,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:52,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:13:52,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:13:52,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:13:52,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:13:52,425 INFO L87 Difference]: Start difference. First operand 817 states and 1009 transitions. Second operand 6 states. [2018-11-26 13:13:52,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:52,499 INFO L93 Difference]: Finished difference Result 1641 states and 2036 transitions. [2018-11-26 13:13:52,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:13:52,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2018-11-26 13:13:52,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:52,504 INFO L225 Difference]: With dead ends: 1641 [2018-11-26 13:13:52,504 INFO L226 Difference]: Without dead ends: 838 [2018-11-26 13:13:52,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:13:52,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2018-11-26 13:13:52,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 832. [2018-11-26 13:13:52,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832 states. [2018-11-26 13:13:52,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1022 transitions. [2018-11-26 13:13:52,538 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1022 transitions. Word has length 110 [2018-11-26 13:13:52,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:52,538 INFO L480 AbstractCegarLoop]: Abstraction has 832 states and 1022 transitions. [2018-11-26 13:13:52,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:13:52,539 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1022 transitions. [2018-11-26 13:13:52,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-26 13:13:52,541 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:52,541 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-26 13:13:52,541 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:52,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:52,542 INFO L82 PathProgramCache]: Analyzing trace with hash -589922631, now seen corresponding path program 1 times [2018-11-26 13:13:52,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:52,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:52,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:52,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:52,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:52,672 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-26 13:13:52,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:52,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-26 13:13:52,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:13:52,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:13:52,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:52,673 INFO L87 Difference]: Start difference. First operand 832 states and 1022 transitions. Second operand 5 states. [2018-11-26 13:13:52,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:52,716 INFO L93 Difference]: Finished difference Result 1260 states and 1553 transitions. [2018-11-26 13:13:52,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-26 13:13:52,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2018-11-26 13:13:52,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:52,721 INFO L225 Difference]: With dead ends: 1260 [2018-11-26 13:13:52,721 INFO L226 Difference]: Without dead ends: 840 [2018-11-26 13:13:52,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:52,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2018-11-26 13:13:52,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 840. [2018-11-26 13:13:52,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2018-11-26 13:13:52,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1030 transitions. [2018-11-26 13:13:52,752 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1030 transitions. Word has length 116 [2018-11-26 13:13:52,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:52,753 INFO L480 AbstractCegarLoop]: Abstraction has 840 states and 1030 transitions. [2018-11-26 13:13:52,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:13:52,753 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1030 transitions. [2018-11-26 13:13:52,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-26 13:13:52,755 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:52,755 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-26 13:13:52,755 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:52,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:52,756 INFO L82 PathProgramCache]: Analyzing trace with hash -995031749, now seen corresponding path program 1 times [2018-11-26 13:13:52,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:52,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:52,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:52,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:52,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:52,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-26 13:13:52,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:52,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-26 13:13:52,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:13:52,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:13:52,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:52,901 INFO L87 Difference]: Start difference. First operand 840 states and 1030 transitions. Second operand 5 states. [2018-11-26 13:13:52,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:52,943 INFO L93 Difference]: Finished difference Result 1404 states and 1723 transitions. [2018-11-26 13:13:52,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-26 13:13:52,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2018-11-26 13:13:52,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:52,948 INFO L225 Difference]: With dead ends: 1404 [2018-11-26 13:13:52,948 INFO L226 Difference]: Without dead ends: 583 [2018-11-26 13:13:52,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:52,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2018-11-26 13:13:52,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2018-11-26 13:13:52,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2018-11-26 13:13:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 705 transitions. [2018-11-26 13:13:52,972 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 705 transitions. Word has length 120 [2018-11-26 13:13:52,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:52,973 INFO L480 AbstractCegarLoop]: Abstraction has 583 states and 705 transitions. [2018-11-26 13:13:52,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:13:52,973 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 705 transitions. [2018-11-26 13:13:52,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-26 13:13:52,976 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:52,976 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-26 13:13:52,976 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:52,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:52,976 INFO L82 PathProgramCache]: Analyzing trace with hash 249732732, now seen corresponding path program 1 times [2018-11-26 13:13:52,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:52,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:52,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:52,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:52,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:53,139 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-26 13:13:53,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:53,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:13:53,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:13:53,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:13:53,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:13:53,140 INFO L87 Difference]: Start difference. First operand 583 states and 705 transitions. Second operand 6 states. [2018-11-26 13:13:54,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:54,176 INFO L93 Difference]: Finished difference Result 1044 states and 1272 transitions. [2018-11-26 13:13:54,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-26 13:13:54,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2018-11-26 13:13:54,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:54,184 INFO L225 Difference]: With dead ends: 1044 [2018-11-26 13:13:54,185 INFO L226 Difference]: Without dead ends: 1041 [2018-11-26 13:13:54,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:13:54,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2018-11-26 13:13:54,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1007. [2018-11-26 13:13:54,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2018-11-26 13:13:54,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1236 transitions. [2018-11-26 13:13:54,247 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1236 transitions. Word has length 120 [2018-11-26 13:13:54,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:54,248 INFO L480 AbstractCegarLoop]: Abstraction has 1007 states and 1236 transitions. [2018-11-26 13:13:54,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:13:54,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1236 transitions. [2018-11-26 13:13:54,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-26 13:13:54,250 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:54,250 INFO L402 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:54,250 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:54,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:54,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1326644216, now seen corresponding path program 1 times [2018-11-26 13:13:54,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:54,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:54,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:54,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:54,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-26 13:13:54,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:54,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:13:54,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:13:54,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:13:54,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:13:54,397 INFO L87 Difference]: Start difference. First operand 1007 states and 1236 transitions. Second operand 6 states. [2018-11-26 13:13:54,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:54,550 INFO L93 Difference]: Finished difference Result 1994 states and 2459 transitions. [2018-11-26 13:13:54,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:13:54,551 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2018-11-26 13:13:54,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:54,559 INFO L225 Difference]: With dead ends: 1994 [2018-11-26 13:13:54,559 INFO L226 Difference]: Without dead ends: 997 [2018-11-26 13:13:54,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:13:54,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-11-26 13:13:54,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 964. [2018-11-26 13:13:54,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2018-11-26 13:13:54,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1194 transitions. [2018-11-26 13:13:54,665 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1194 transitions. Word has length 124 [2018-11-26 13:13:54,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:54,665 INFO L480 AbstractCegarLoop]: Abstraction has 964 states and 1194 transitions. [2018-11-26 13:13:54,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:13:54,666 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1194 transitions. [2018-11-26 13:13:54,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-26 13:13:54,668 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:54,668 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-26 13:13:54,668 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:54,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:54,668 INFO L82 PathProgramCache]: Analyzing trace with hash 2132993389, now seen corresponding path program 1 times [2018-11-26 13:13:54,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:54,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:54,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:54,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:54,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:54,802 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-26 13:13:54,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:54,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-26 13:13:54,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-26 13:13:54,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-26 13:13:54,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-26 13:13:54,804 INFO L87 Difference]: Start difference. First operand 964 states and 1194 transitions. Second operand 3 states. [2018-11-26 13:13:54,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:54,860 INFO L93 Difference]: Finished difference Result 1810 states and 2274 transitions. [2018-11-26 13:13:54,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-26 13:13:54,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2018-11-26 13:13:54,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:54,866 INFO L225 Difference]: With dead ends: 1810 [2018-11-26 13:13:54,866 INFO L226 Difference]: Without dead ends: 940 [2018-11-26 13:13:54,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-26 13:13:54,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2018-11-26 13:13:54,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2018-11-26 13:13:54,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2018-11-26 13:13:54,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1155 transitions. [2018-11-26 13:13:54,923 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1155 transitions. Word has length 133 [2018-11-26 13:13:54,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:54,923 INFO L480 AbstractCegarLoop]: Abstraction has 940 states and 1155 transitions. [2018-11-26 13:13:54,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-26 13:13:54,924 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1155 transitions. [2018-11-26 13:13:54,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-26 13:13:54,925 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:54,925 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-26 13:13:54,926 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:54,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:54,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1289599528, now seen corresponding path program 1 times [2018-11-26 13:13:54,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:54,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:54,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:54,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:54,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:55,057 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-26 13:13:55,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:55,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-26 13:13:55,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:13:55,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:13:55,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:55,058 INFO L87 Difference]: Start difference. First operand 940 states and 1155 transitions. Second operand 5 states. [2018-11-26 13:13:55,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:55,106 INFO L93 Difference]: Finished difference Result 983 states and 1203 transitions. [2018-11-26 13:13:55,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-26 13:13:55,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2018-11-26 13:13:55,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:55,114 INFO L225 Difference]: With dead ends: 983 [2018-11-26 13:13:55,114 INFO L226 Difference]: Without dead ends: 948 [2018-11-26 13:13:55,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:55,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2018-11-26 13:13:55,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 948. [2018-11-26 13:13:55,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-11-26 13:13:55,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1160 transitions. [2018-11-26 13:13:55,166 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1160 transitions. Word has length 135 [2018-11-26 13:13:55,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:55,167 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 1160 transitions. [2018-11-26 13:13:55,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:13:55,167 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1160 transitions. [2018-11-26 13:13:55,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-26 13:13:55,169 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:55,169 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-26 13:13:55,169 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:55,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:55,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1311418946, now seen corresponding path program 1 times [2018-11-26 13:13:55,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:55,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:55,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:55,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:55,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:55,427 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-26 13:13:55,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:55,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-26 13:13:55,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-26 13:13:55,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-26 13:13:55,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:13:55,429 INFO L87 Difference]: Start difference. First operand 948 states and 1160 transitions. Second operand 8 states. [2018-11-26 13:13:56,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:56,600 INFO L93 Difference]: Finished difference Result 1987 states and 2552 transitions. [2018-11-26 13:13:56,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-26 13:13:56,601 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 136 [2018-11-26 13:13:56,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:56,611 INFO L225 Difference]: With dead ends: 1987 [2018-11-26 13:13:56,611 INFO L226 Difference]: Without dead ends: 1511 [2018-11-26 13:13:56,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-26 13:13:56,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2018-11-26 13:13:56,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1216. [2018-11-26 13:13:56,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2018-11-26 13:13:56,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1486 transitions. [2018-11-26 13:13:56,709 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1486 transitions. Word has length 136 [2018-11-26 13:13:56,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:56,709 INFO L480 AbstractCegarLoop]: Abstraction has 1216 states and 1486 transitions. [2018-11-26 13:13:56,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-26 13:13:56,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1486 transitions. [2018-11-26 13:13:56,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-26 13:13:56,712 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:56,712 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-26 13:13:56,712 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:56,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:56,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1870756101, now seen corresponding path program 1 times [2018-11-26 13:13:56,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:56,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:56,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:56,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:56,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:56,888 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-26 13:13:56,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:56,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-26 13:13:56,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:13:56,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:13:56,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:56,889 INFO L87 Difference]: Start difference. First operand 1216 states and 1486 transitions. Second operand 5 states. [2018-11-26 13:13:56,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:56,960 INFO L93 Difference]: Finished difference Result 1828 states and 2237 transitions. [2018-11-26 13:13:56,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-26 13:13:56,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2018-11-26 13:13:56,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:56,967 INFO L225 Difference]: With dead ends: 1828 [2018-11-26 13:13:56,967 INFO L226 Difference]: Without dead ends: 688 [2018-11-26 13:13:56,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:56,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2018-11-26 13:13:57,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2018-11-26 13:13:57,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2018-11-26 13:13:57,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 829 transitions. [2018-11-26 13:13:57,023 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 829 transitions. Word has length 152 [2018-11-26 13:13:57,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:57,024 INFO L480 AbstractCegarLoop]: Abstraction has 688 states and 829 transitions. [2018-11-26 13:13:57,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:13:57,024 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 829 transitions. [2018-11-26 13:13:57,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-26 13:13:57,027 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:57,027 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-26 13:13:57,027 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:57,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:57,028 INFO L82 PathProgramCache]: Analyzing trace with hash 687408804, now seen corresponding path program 1 times [2018-11-26 13:13:57,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:57,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:57,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:57,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:57,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:57,256 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-26 13:13:57,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:57,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:13:57,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:13:57,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:13:57,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:13:57,258 INFO L87 Difference]: Start difference. First operand 688 states and 829 transitions. Second operand 6 states. [2018-11-26 13:13:58,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:58,100 INFO L93 Difference]: Finished difference Result 1106 states and 1341 transitions. [2018-11-26 13:13:58,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-26 13:13:58,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2018-11-26 13:13:58,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:58,108 INFO L225 Difference]: With dead ends: 1106 [2018-11-26 13:13:58,108 INFO L226 Difference]: Without dead ends: 1101 [2018-11-26 13:13:58,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:13:58,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2018-11-26 13:13:58,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1062. [2018-11-26 13:13:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2018-11-26 13:13:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1296 transitions. [2018-11-26 13:13:58,194 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1296 transitions. Word has length 152 [2018-11-26 13:13:58,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:58,195 INFO L480 AbstractCegarLoop]: Abstraction has 1062 states and 1296 transitions. [2018-11-26 13:13:58,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:13:58,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1296 transitions. [2018-11-26 13:13:58,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-26 13:13:58,197 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:58,197 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-26 13:13:58,197 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:58,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:58,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1237359020, now seen corresponding path program 1 times [2018-11-26 13:13:58,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:58,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:58,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:58,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:58,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:58,344 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-26 13:13:58,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:58,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-26 13:13:58,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:13:58,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:13:58,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:58,345 INFO L87 Difference]: Start difference. First operand 1062 states and 1296 transitions. Second operand 5 states. [2018-11-26 13:13:58,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:58,441 INFO L93 Difference]: Finished difference Result 1100 states and 1336 transitions. [2018-11-26 13:13:58,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-26 13:13:58,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2018-11-26 13:13:58,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:58,448 INFO L225 Difference]: With dead ends: 1100 [2018-11-26 13:13:58,449 INFO L226 Difference]: Without dead ends: 1083 [2018-11-26 13:13:58,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:13:58,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2018-11-26 13:13:58,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1066. [2018-11-26 13:13:58,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1066 states. [2018-11-26 13:13:58,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1299 transitions. [2018-11-26 13:13:58,518 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1299 transitions. Word has length 160 [2018-11-26 13:13:58,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:58,518 INFO L480 AbstractCegarLoop]: Abstraction has 1066 states and 1299 transitions. [2018-11-26 13:13:58,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:13:58,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1299 transitions. [2018-11-26 13:13:58,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-26 13:13:58,520 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:58,521 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-26 13:13:58,521 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:58,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:58,521 INFO L82 PathProgramCache]: Analyzing trace with hash 711197501, now seen corresponding path program 1 times [2018-11-26 13:13:58,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:58,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:58,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:58,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:58,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-26 13:13:58,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-26 13:13:58,667 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-26 13:13:58,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:58,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:13:58,972 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-26 13:13:59,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-26 13:13:59,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-11-26 13:13:59,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:13:59,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:13:59,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:59,004 INFO L87 Difference]: Start difference. First operand 1066 states and 1299 transitions. Second operand 5 states. [2018-11-26 13:13:59,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:59,120 INFO L93 Difference]: Finished difference Result 2029 states and 2483 transitions. [2018-11-26 13:13:59,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:59,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2018-11-26 13:13:59,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:59,126 INFO L225 Difference]: With dead ends: 2029 [2018-11-26 13:13:59,126 INFO L226 Difference]: Without dead ends: 1021 [2018-11-26 13:13:59,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2018-11-26 13:13:59,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1021. [2018-11-26 13:13:59,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1021 states. [2018-11-26 13:13:59,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1214 transitions. [2018-11-26 13:13:59,213 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1214 transitions. Word has length 164 [2018-11-26 13:13:59,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:59,214 INFO L480 AbstractCegarLoop]: Abstraction has 1021 states and 1214 transitions. [2018-11-26 13:13:59,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:13:59,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1214 transitions. [2018-11-26 13:13:59,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-26 13:13:59,216 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:59,217 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:59,217 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:59,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:59,217 INFO L82 PathProgramCache]: Analyzing trace with hash -348337541, now seen corresponding path program 1 times [2018-11-26 13:13:59,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:59,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:59,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:59,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:59,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:59,354 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-26 13:13:59,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:59,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-26 13:13:59,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-26 13:13:59,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-26 13:13:59,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-26 13:13:59,355 INFO L87 Difference]: Start difference. First operand 1021 states and 1214 transitions. Second operand 3 states. [2018-11-26 13:13:59,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:59,397 INFO L93 Difference]: Finished difference Result 1402 states and 1663 transitions. [2018-11-26 13:13:59,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-26 13:13:59,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2018-11-26 13:13:59,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:59,402 INFO L225 Difference]: With dead ends: 1402 [2018-11-26 13:13:59,402 INFO L226 Difference]: Without dead ends: 678 [2018-11-26 13:13:59,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-26 13:13:59,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2018-11-26 13:13:59,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 675. [2018-11-26 13:13:59,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-11-26 13:13:59,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 784 transitions. [2018-11-26 13:13:59,438 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 784 transitions. Word has length 176 [2018-11-26 13:13:59,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:59,438 INFO L480 AbstractCegarLoop]: Abstraction has 675 states and 784 transitions. [2018-11-26 13:13:59,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-26 13:13:59,438 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 784 transitions. [2018-11-26 13:13:59,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-26 13:13:59,440 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:59,441 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:59,441 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:59,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:59,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1682650176, now seen corresponding path program 1 times [2018-11-26 13:13:59,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:59,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:59,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:59,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:59,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:59,619 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-26 13:13:59,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:59,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-26 13:13:59,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:13:59,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:13:59,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:59,620 INFO L87 Difference]: Start difference. First operand 675 states and 784 transitions. Second operand 5 states. [2018-11-26 13:13:59,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:59,676 INFO L93 Difference]: Finished difference Result 1386 states and 1661 transitions. [2018-11-26 13:13:59,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-26 13:13:59,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2018-11-26 13:13:59,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:59,680 INFO L225 Difference]: With dead ends: 1386 [2018-11-26 13:13:59,680 INFO L226 Difference]: Without dead ends: 814 [2018-11-26 13:13:59,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:59,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2018-11-26 13:13:59,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 756. [2018-11-26 13:13:59,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2018-11-26 13:13:59,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 905 transitions. [2018-11-26 13:13:59,720 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 905 transitions. Word has length 178 [2018-11-26 13:13:59,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:59,720 INFO L480 AbstractCegarLoop]: Abstraction has 756 states and 905 transitions. [2018-11-26 13:13:59,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:13:59,720 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 905 transitions. [2018-11-26 13:13:59,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-26 13:13:59,722 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:59,722 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:59,722 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:59,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:59,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1429299585, now seen corresponding path program 1 times [2018-11-26 13:13:59,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:59,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:59,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:59,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:59,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:00,152 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-26 13:14:00,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:00,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-26 13:14:00,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-26 13:14:00,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-26 13:14:00,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:14:00,153 INFO L87 Difference]: Start difference. First operand 756 states and 905 transitions. Second operand 8 states. [2018-11-26 13:14:01,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:01,323 INFO L93 Difference]: Finished difference Result 920 states and 1120 transitions. [2018-11-26 13:14:01,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-26 13:14:01,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2018-11-26 13:14:01,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:01,329 INFO L225 Difference]: With dead ends: 920 [2018-11-26 13:14:01,329 INFO L226 Difference]: Without dead ends: 873 [2018-11-26 13:14:01,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-26 13:14:01,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2018-11-26 13:14:01,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 752. [2018-11-26 13:14:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-11-26 13:14:01,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 889 transitions. [2018-11-26 13:14:01,389 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 889 transitions. Word has length 178 [2018-11-26 13:14:01,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:01,390 INFO L480 AbstractCegarLoop]: Abstraction has 752 states and 889 transitions. [2018-11-26 13:14:01,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-26 13:14:01,390 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 889 transitions. [2018-11-26 13:14:01,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-26 13:14:01,393 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:01,393 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:01,393 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:01,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:01,394 INFO L82 PathProgramCache]: Analyzing trace with hash -2107567375, now seen corresponding path program 1 times [2018-11-26 13:14:01,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:01,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:01,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:01,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:01,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-26 13:14:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-26 13:14:02,156 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-26 13:14:02,253 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967387 could not be translated for associated CType STRUCT~~usb_driver?name~*CHAR?probe~*((*usb_interface *usb_device_id ) : INT)?disconnect~*((*usb_interface ) : VOID)?unlocked_ioctl~*((*usb_interface UINT *VOID ) : INT)?suspend~*((*usb_interface ~pm_message_t~0 ) : INT)?resume~*((*usb_interface ) : INT)?reset_resume~*((*usb_interface ) : INT)?pre_reset~*((*usb_interface ) : INT)?post_reset~*((*usb_interface ) : INT)?id_table~*usb_device_id?dynids~STRUCT~~usb_dynids?lock~~spinlock_t~0?list~STRUCT~~list_head?next~*list_head?prev~*list_head##?drvwrap~STRUCT~~usbdrv_wrap?driver~STRUCT~~device_driver?name~*CHAR?bus~*bus_type?owner~*module?mod_name~*CHAR?suppress_bind_attrs~~bool~0?of_match_table~*of_device_id?probe~*((*device ) : INT)?remove~*((*device ) : INT)?shutdown~*((*device ) : VOID)?suspend~*((*device ~pm_message_t~0 ) : INT)?resume~*((*device ) : INT)?groups~**attribute_group?pm~*dev_pm_ops?p~*driver_private#?for_devices~INT#?no_dynamic_id~UINT?supports_autosuspend~UINT?soft_unbind~UINT# [2018-11-26 13:14:02,254 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967307 could not be translated for associated CType ARRAY#_1_~STRUCT~~usb_device_id?match_flags~~__u16~0?idVendor~~__u16~0?idProduct~~__u16~0?bcdDevice_lo~~__u16~0?bcdDevice_hi~~__u16~0?bDeviceClass~~__u8~0?bDeviceSubClass~~__u8~0?bDeviceProtocol~~__u8~0?bInterfaceClass~~__u8~0?bInterfaceSubClass~~__u8~0?bInterfaceProtocol~~__u8~0?driver_info~~kernel_ulong_t~0## [2018-11-26 13:14:02,254 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967318 could not be translated for associated CType ARRAY#_1_~STRUCT~~usb_device_id?match_flags~~__u16~0?idVendor~~__u16~0?idProduct~~__u16~0?bcdDevice_lo~~__u16~0?bcdDevice_hi~~__u16~0?bDeviceClass~~__u8~0?bDeviceSubClass~~__u8~0?bDeviceProtocol~~__u8~0?bInterfaceClass~~__u8~0?bInterfaceSubClass~~__u8~0?bInterfaceProtocol~~__u8~0?driver_info~~kernel_ulong_t~0## [2018-11-26 13:14:02,257 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967349 could not be translated for associated CType STRUCT~~usb_driver?name~*CHAR?probe~*((*usb_interface *usb_device_id ) : INT)?disconnect~*((*usb_interface ) : VOID)?unlocked_ioctl~*((*usb_interface UINT *VOID ) : INT)?suspend~*((*usb_interface ~pm_message_t~0 ) : INT)?resume~*((*usb_interface ) : INT)?reset_resume~*((*usb_interface ) : INT)?pre_reset~*((*usb_interface ) : INT)?post_reset~*((*usb_interface ) : INT)?id_table~*usb_device_id?dynids~STRUCT~~usb_dynids?lock~~spinlock_t~0?list~STRUCT~~list_head?next~*list_head?prev~*list_head##?drvwrap~STRUCT~~usbdrv_wrap?driver~STRUCT~~device_driver?name~*CHAR?bus~*bus_type?owner~*module?mod_name~*CHAR?suppress_bind_attrs~~bool~0?of_match_table~*of_device_id?probe~*((*device ) : INT)?remove~*((*device ) : INT)?shutdown~*((*device ) : VOID)?suspend~*((*device ~pm_message_t~0 ) : INT)?resume~*((*device ) : INT)?groups~**attribute_group?pm~*dev_pm_ops?p~*driver_private#?for_devices~INT#?no_dynamic_id~UINT?supports_autosuspend~UINT?soft_unbind~UINT# [2018-11-26 13:14:02,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 01:14:02 BoogieIcfgContainer [2018-11-26 13:14:02,334 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-26 13:14:02,335 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-26 13:14:02,335 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-26 13:14:02,335 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-26 13:14:02,335 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:13:50" (3/4) ... [2018-11-26 13:14:02,340 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-26 13:14:02,340 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-26 13:14:02,341 INFO L168 Benchmark]: Toolchain (without parser) took 14107.46 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 407.9 MB). Free memory was 942.4 MB in the beginning and 1.3 GB in the end (delta: -328.3 MB). Peak memory consumption was 79.6 MB. Max. memory is 11.5 GB. [2018-11-26 13:14:02,343 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-26 13:14:02,344 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1010.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -115.8 MB). Peak memory consumption was 75.6 MB. Max. memory is 11.5 GB. [2018-11-26 13:14:02,345 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-26 13:14:02,345 INFO L168 Benchmark]: Boogie Preprocessor took 82.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-11-26 13:14:02,346 INFO L168 Benchmark]: RCFGBuilder took 1178.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 932.2 MB in the end (delta: 118.9 MB). Peak memory consumption was 118.9 MB. Max. memory is 11.5 GB. [2018-11-26 13:14:02,346 INFO L168 Benchmark]: TraceAbstraction took 11776.04 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 294.6 MB). Free memory was 932.2 MB in the beginning and 1.3 GB in the end (delta: -338.5 MB). Peak memory consumption was 485.8 MB. Max. memory is 11.5 GB. [2018-11-26 13:14:02,347 INFO L168 Benchmark]: Witness Printer took 5.50 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-26 13:14:02,351 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1010.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -115.8 MB). Peak memory consumption was 75.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 82.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1178.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 932.2 MB in the end (delta: 118.9 MB). Peak memory consumption was 118.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11776.04 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 294.6 MB). Free memory was 932.2 MB in the beginning and 1.3 GB in the end (delta: -338.5 MB). Peak memory consumption was 485.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.50 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 4294967387 could not be translated for associated CType STRUCT~~usb_driver?name~*CHAR?probe~*((*usb_interface *usb_device_id ) : INT)?disconnect~*((*usb_interface ) : VOID)?unlocked_ioctl~*((*usb_interface UINT *VOID ) : INT)?suspend~*((*usb_interface ~pm_message_t~0 ) : INT)?resume~*((*usb_interface ) : INT)?reset_resume~*((*usb_interface ) : INT)?pre_reset~*((*usb_interface ) : INT)?post_reset~*((*usb_interface ) : INT)?id_table~*usb_device_id?dynids~STRUCT~~usb_dynids?lock~~spinlock_t~0?list~STRUCT~~list_head?next~*list_head?prev~*list_head##?drvwrap~STRUCT~~usbdrv_wrap?driver~STRUCT~~device_driver?name~*CHAR?bus~*bus_type?owner~*module?mod_name~*CHAR?suppress_bind_attrs~~bool~0?of_match_table~*of_device_id?probe~*((*device ) : INT)?remove~*((*device ) : INT)?shutdown~*((*device ) : VOID)?suspend~*((*device ~pm_message_t~0 ) : INT)?resume~*((*device ) : INT)?groups~**attribute_group?pm~*dev_pm_ops?p~*driver_private#?for_devices~INT#?no_dynamic_id~UINT?supports_autosuspend~UINT?soft_unbind~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 4294967307 could not be translated for associated CType ARRAY#_1_~STRUCT~~usb_device_id?match_flags~~__u16~0?idVendor~~__u16~0?idProduct~~__u16~0?bcdDevice_lo~~__u16~0?bcdDevice_hi~~__u16~0?bDeviceClass~~__u8~0?bDeviceSubClass~~__u8~0?bDeviceProtocol~~__u8~0?bInterfaceClass~~__u8~0?bInterfaceSubClass~~__u8~0?bInterfaceProtocol~~__u8~0?driver_info~~kernel_ulong_t~0## - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 4294967318 could not be translated for associated CType ARRAY#_1_~STRUCT~~usb_device_id?match_flags~~__u16~0?idVendor~~__u16~0?idProduct~~__u16~0?bcdDevice_lo~~__u16~0?bcdDevice_hi~~__u16~0?bDeviceClass~~__u8~0?bDeviceSubClass~~__u8~0?bDeviceProtocol~~__u8~0?bInterfaceClass~~__u8~0?bInterfaceSubClass~~__u8~0?bInterfaceProtocol~~__u8~0?driver_info~~kernel_ulong_t~0## - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 4294967349 could not be translated for associated CType STRUCT~~usb_driver?name~*CHAR?probe~*((*usb_interface *usb_device_id ) : INT)?disconnect~*((*usb_interface ) : VOID)?unlocked_ioctl~*((*usb_interface UINT *VOID ) : INT)?suspend~*((*usb_interface ~pm_message_t~0 ) : INT)?resume~*((*usb_interface ) : INT)?reset_resume~*((*usb_interface ) : INT)?pre_reset~*((*usb_interface ) : INT)?post_reset~*((*usb_interface ) : INT)?id_table~*usb_device_id?dynids~STRUCT~~usb_dynids?lock~~spinlock_t~0?list~STRUCT~~list_head?next~*list_head?prev~*list_head##?drvwrap~STRUCT~~usbdrv_wrap?driver~STRUCT~~device_driver?name~*CHAR?bus~*bus_type?owner~*module?mod_name~*CHAR?suppress_bind_attrs~~bool~0?of_match_table~*of_device_id?probe~*((*device ) : INT)?remove~*((*device ) : INT)?shutdown~*((*device ) : VOID)?suspend~*((*device ~pm_message_t~0 ) : INT)?resume~*((*device ) : INT)?groups~**attribute_group?pm~*dev_pm_ops?p~*driver_private#?for_devices~INT#?no_dynamic_id~UINT?supports_autosuspend~UINT?soft_unbind~UINT# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 4159]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of large string literal at line 3486, overapproximation of strlen at line 3892, overapproximation of bitwiseOr at line 3927, overapproximation of shiftLeft at line 3522, overapproximation of bitwiseAnd at line 3575. Possible FailurePath: [L3670-L3681] static char const __mod_author48[39] __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 )'u', (char const )'c', (char const )'w', (char const )'.', (char const )'c', (char const )'z', (char const )'>', (char const )'\000'}; [L3682-L3695] static char const __mod_description49[47] __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 )'U', (char const )'S', (char const )'B', (char const )' ', (char const )'H', (char const )'I', (char const )'D', (char const )' ', (char const )'B', (char const )'o', (char const )'o', (char const )'t', (char const )' ', (char const )'P', (char const )'r', (char const )'o', (char const )'t', (char const )'o', (char const )'c', (char const )'o', (char const )'l', (char const )' ', (char const )'m', (char const )'o', (char const )'u', (char const )'s', (char const )'e', (char const )' ', (char const )'d', (char const )'r', (char const )'i', (char const )'v', (char const )'e', (char const )'r', (char const )'\000'}; [L3696-L3700] static char const __mod_license50[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'}; [L3982-L3984] static struct usb_device_id usb_mouse_id_table[1] = { {(__u16 )896, (unsigned short)0, (unsigned short)0, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (__u8 )3, (__u8 )1, (__u8 )2, 0UL}}; [L3987-L4003] static struct usb_driver usb_mouse_driver = {"usbmouse", & usb_mouse_probe, & usb_mouse_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 *)(usb_mouse_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}; [L4061] int LDV_IN_INTERRUPT ; [L4062] static int res_usb_mouse_probe_3 ; [L4173] int ldv_urb_state = 0; [L4174] int ldv_coherent_state = 0; VAL [\old(ldv_coherent_state)=4294967300, \old(LDV_IN_INTERRUPT)=4294967316, \old(ldv_urb_state)=4294967352, \old(res_usb_mouse_probe_3)=4294967404, \old(usb_mouse_driver)=null, \old(usb_mouse_driver)=null, \old(usb_mouse_id_table)=null, \old(usb_mouse_id_table)=null, ldv_coherent_state=0, LDV_IN_INTERRUPT=0, ldv_urb_state=0, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L4064] struct usb_interface *var_group1 ; [L4065] struct usb_device_id const *var_usb_mouse_probe_3_p1 ; [L4066] int tmp___7 ; [L4067] int ldv_s_usb_mouse_driver_usb_driver ; [L4068] int tmp___8 ; [L4069] int tmp___9 ; [L4073] LDV_IN_INTERRUPT = 1 [L4075] CALL, EXPR usb_mouse_init() VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L4007] int retval ; [L4008] int tmp___7 ; VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L4012] CALL, EXPR usb_register(& usb_mouse_driver) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, driver={4294967342:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3498] int tmp___7 ; [L3502] tmp___7 = usb_register_driver(driver, & __this_module, "usbmouse") [L3504] return (tmp___7); VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, \result=0, driver={4294967342:0}, driver={4294967342:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, tmp___7=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L4012] RET, EXPR usb_register(& usb_mouse_driver) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}, usb_register(& usb_mouse_driver)=0] [L4012] tmp___7 = usb_register(& usb_mouse_driver) [L4013] retval = tmp___7 VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, retval=0, tmp___7=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L4015] COND TRUE retval == 0 [L4022] return (retval); VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, \result=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, retval=0, tmp___7=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L4075] RET, EXPR usb_mouse_init() VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}, usb_mouse_init()=0] [L4075] tmp___7 = usb_mouse_init() [L4077] COND FALSE !(\read(tmp___7)) [L4082] ldv_s_usb_mouse_driver_usb_driver = 0 VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_usb_mouse_driver_usb_driver=0, ldv_urb_state=0, res_usb_mouse_probe_3=0, tmp___7=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L4084] COND TRUE 1 VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_usb_mouse_driver_usb_driver=0, ldv_urb_state=0, res_usb_mouse_probe_3=0, tmp___7=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L4087] tmp___9 = __VERIFIER_nondet_int() [L4089] COND TRUE \read(tmp___9) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_usb_mouse_driver_usb_driver=0, ldv_urb_state=0, res_usb_mouse_probe_3=0, tmp___7=0, tmp___9=1, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L4098] tmp___8 = __VERIFIER_nondet_int() [L4100] COND TRUE tmp___8 == 0 VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_usb_mouse_driver_usb_driver=0, ldv_urb_state=0, res_usb_mouse_probe_3=0, tmp___7=0, tmp___8=0, tmp___9=1, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L4109] COND TRUE ldv_s_usb_mouse_driver_usb_driver == 0 VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_usb_mouse_driver_usb_driver=0, ldv_urb_state=0, res_usb_mouse_probe_3=0, tmp___7=0, tmp___8=0, tmp___9=1, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L4111] CALL, EXPR usb_mouse_probe(var_group1, var_usb_mouse_probe_3_p1) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, id={4294967329:4294967392}, intf={4294967302:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3795] struct usb_device *dev ; [L3796] struct usb_device *tmp___7 ; [L3797] struct usb_host_interface *interface ; [L3798] struct usb_endpoint_descriptor *endpoint ; [L3799] struct usb_mouse *mouse ; [L3800] struct input_dev *input_dev ; [L3801] int pipe ; [L3802] int maxp ; [L3803] int error ; [L3804] int tmp___8 ; [L3805] unsigned int tmp___9 ; [L3806] __u16 tmp___10 ; [L3807] void *tmp___11 ; [L3808] void *tmp___12 ; [L3809] unsigned long tmp___13 ; [L3810] int tmp___14 ; [L3811] int tmp ; VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, id={4294967329:4294967392}, id={4294967329:4294967392}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3815] CALL, EXPR interface_to_usbdev(intf) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, intf={4294967302:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3473] struct device const *__mptr ; [L3476] EXPR intf->dev.parent [L3476] __mptr = (struct device const *)intf->dev.parent [L3477] return ((struct usb_device *)((char *)__mptr - (unsigned int )(& ((struct usb_device *)0)->dev))); VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, \result={4294967341:0}, __mptr={4294967341:131}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3815] RET, EXPR interface_to_usbdev(intf) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, id={4294967329:4294967392}, id={4294967329:4294967392}, interface_to_usbdev(intf)={4294967341:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3815] tmp___7 = interface_to_usbdev(intf) [L3816] dev = tmp___7 [L3817] error = -12 [L3818] EXPR intf->cur_altsetting [L3818] interface = intf->cur_altsetting [L3820] EXPR interface->desc.bNumEndpoints VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, error=-12, id={4294967329:4294967392}, id={4294967329:4294967392}, interface={4294967332:0}, interface->desc.bNumEndpoints=-255, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, tmp___7={4294967341:0}, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3820] COND FALSE !((int )interface->desc.bNumEndpoints != 1) [L3826] EXPR interface->endpoint [L3826] endpoint = & (interface->endpoint + 0)->desc [L3827] CALL, EXPR usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, epd={4294967323:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3423] int tmp ; [L3424] int tmp___0 ; [L3425] int tmp___1 ; VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, epd={4294967323:0}, epd={4294967323:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3429] CALL, EXPR usb_endpoint_xfer_int(epd) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, epd={4294967323:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3419] EXPR epd->bmAttributes [L3419] return (((int const )epd->bmAttributes & 3) == 3); [L3429] RET, EXPR usb_endpoint_xfer_int(epd) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, epd={4294967323:0}, epd={4294967323:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, usb_endpoint_xfer_int(epd)=1, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3429] tmp = usb_endpoint_xfer_int(epd) [L3431] COND TRUE \read(tmp) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, epd={4294967323:0}, epd={4294967323:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, tmp=1, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3433] CALL, EXPR usb_endpoint_dir_in(epd) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, epd={4294967323:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3412] EXPR epd->bEndpointAddress [L3412] return (((int const )epd->bEndpointAddress & 128) == 128); [L3433] RET, EXPR usb_endpoint_dir_in(epd) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, epd={4294967323:0}, epd={4294967323:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, tmp=1, usb_endpoint_dir_in(epd)=1, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3433] tmp___0 = usb_endpoint_dir_in(epd) [L3435] COND TRUE \read(tmp___0) [L3436] tmp___1 = 1 VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, epd={4294967323:0}, epd={4294967323:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, tmp=1, tmp___0=1, tmp___1=1, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3443] return (tmp___1); VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, \result=1, epd={4294967323:0}, epd={4294967323:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, tmp=1, tmp___0=1, tmp___1=1, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3827] RET, EXPR usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, endpoint={4294967323:0}, error=-12, id={4294967329:4294967392}, id={4294967329:4294967392}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, tmp___7={4294967341:0}, usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint)=1, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3827] tmp___8 = usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3829] COND TRUE \read(tmp___8) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, endpoint={4294967323:0}, error=-12, id={4294967329:4294967392}, id={4294967329:4294967392}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, tmp___7={4294967341:0}, tmp___8=1, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3835] EXPR endpoint->bEndpointAddress VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, endpoint={4294967323:0}, endpoint->bEndpointAddress=0, error=-12, id={4294967329:4294967392}, id={4294967329:4294967392}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, tmp___7={4294967341:0}, tmp___8=1, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3835] CALL, EXPR __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) VAL [\old(endpoint)=0, \old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3544] EXPR dev->devnum [L3544] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L3835] RET, EXPR __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress)=4294967338, dev={4294967341:0}, endpoint={4294967323:0}, endpoint->bEndpointAddress=0, error=-12, id={4294967329:4294967392}, id={4294967329:4294967392}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, tmp___7={4294967341:0}, tmp___8=1, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3835] tmp___9 = __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3836] pipe = (int )(((unsigned int )(1 << 30) | tmp___9) | 128U) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, endpoint={4294967323:0}, error=-12, id={4294967329:4294967392}, id={4294967329:4294967392}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, pipe=0, res_usb_mouse_probe_3=0, tmp___7={4294967341:0}, tmp___8=1, tmp___9=42, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3837] CALL, EXPR usb_maxpacket(dev, pipe, ! (pipe & 128)) VAL [\old(is_out)=0, \old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(pipe)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, udev={4294967341:0}, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3548] struct usb_host_endpoint *ep ; [L3549] unsigned int epnum ; [L3550] int __ret_warn_on ; [L3551] long tmp___7 ; [L3552] int __ret_warn_on___0 ; [L3553] long tmp___8 ; [L3556] epnum = (unsigned int )((pipe >> 15) & 15) VAL [\old(is_out)=0, \old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(pipe)=0, \old(res_usb_mouse_probe_3)=0, is_out=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, pipe=0, res_usb_mouse_probe_3=0, udev={4294967341:0}, udev={4294967341:0}, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3557] COND FALSE !(\read(is_out)) [L3575] __ret_warn_on___0 = ! (! (! (pipe & 128))) [L3576] tmp___8 = __builtin_expect((long )(! (! __ret_warn_on___0)), 0L) VAL [\old(is_out)=0, \old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(pipe)=0, \old(res_usb_mouse_probe_3)=0, __ret_warn_on___0=1, is_out=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, pipe=0, res_usb_mouse_probe_3=0, tmp___8=1, udev={4294967341:0}, udev={4294967341:0}, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3578] COND TRUE \read(tmp___8) [L3587] EXPR udev->ep_in[epnum] [L3587] ep = udev->ep_in[epnum] [L3590] COND FALSE !(! ep) [L3595] EXPR ep->desc.wMaxPacketSize [L3595] return (ep->desc.wMaxPacketSize); [L3837] RET, EXPR usb_maxpacket(dev, pipe, ! (pipe & 128)) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, endpoint={4294967323:0}, error=-12, id={4294967329:4294967392}, id={4294967329:4294967392}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, pipe=0, res_usb_mouse_probe_3=0, tmp___7={4294967341:0}, tmp___8=1, tmp___9=42, usb_maxpacket(dev, pipe, ! (pipe & 128))=65545, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3837] tmp___10 = usb_maxpacket(dev, pipe, ! (pipe & 128)) [L3838] maxp = (int )tmp___10 VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, endpoint={4294967323:0}, error=-12, id={4294967329:4294967392}, id={4294967329:4294967392}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, maxp=9, pipe=0, res_usb_mouse_probe_3=0, tmp___10=9, tmp___7={4294967341:0}, tmp___8=1, tmp___9=42, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3839] CALL, EXPR kzalloc(sizeof(struct usb_mouse ), 208U) VAL [\old(flags)=208, \old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, \old(size)=232, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3396] void *tmp ; VAL [\old(flags)=208, \old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, \old(size)=232, flags=208, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, size=232, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3400] CALL, EXPR kmalloc(size, flags | 32768U) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, \old(size)=232, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3386] void *tmp___2 ; [L3390] tmp___2 = __kmalloc(size, flags) [L3392] return (tmp___2); VAL [\old(flags)=51, \old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, \old(size)=232, \result={4294967341:-52}, flags=51, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, size=232, tmp___2={4294967341:-52}, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3400] RET, EXPR kmalloc(size, flags | 32768U) VAL [\old(flags)=208, \old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, \old(size)=232, flags=208, kmalloc(size, flags | 32768U)={4294967341:-52}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, size=232, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3400] tmp = kmalloc(size, flags | 32768U) [L3402] return (tmp); VAL [\old(flags)=208, \old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, \old(size)=232, \result={4294967341:-52}, flags=208, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, size=232, tmp={4294967341:-52}, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3839] RET, EXPR kzalloc(sizeof(struct usb_mouse ), 208U) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, endpoint={4294967323:0}, error=-12, id={4294967329:4294967392}, id={4294967329:4294967392}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, kzalloc(sizeof(struct usb_mouse ), 208U)={4294967341:-52}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, maxp=9, pipe=0, res_usb_mouse_probe_3=0, tmp___10=9, tmp___7={4294967341:0}, tmp___8=1, tmp___9=42, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3839] tmp___11 = kzalloc(sizeof(struct usb_mouse ), 208U) [L3840] mouse = (struct usb_mouse *)tmp___11 VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, endpoint={4294967323:0}, error=-12, id={4294967329:4294967392}, id={4294967329:4294967392}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, maxp=9, mouse={4294967341:-52}, pipe=0, res_usb_mouse_probe_3=0, tmp___10=9, tmp___11={4294967341:-52}, tmp___7={4294967341:0}, tmp___8=1, tmp___9=42, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3841] CALL, EXPR input_allocate_device() VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3599] CALL, EXPR kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, \old(size)=1928, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3396] void *tmp ; VAL [\old(flags)=18, \old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, \old(size)=1928, flags=18, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, size=1928, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3400] CALL, EXPR kmalloc(size, flags | 32768U) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, \old(size)=1928, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3386] void *tmp___2 ; [L3390] tmp___2 = __kmalloc(size, flags) [L3392] return (tmp___2); VAL [\old(flags)=88, \old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, \old(size)=1928, \result={4294967322:-24}, flags=88, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, size=1928, tmp___2={4294967322:-24}, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3400] RET, EXPR kmalloc(size, flags | 32768U) VAL [\old(flags)=18, \old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, \old(size)=1928, flags=18, kmalloc(size, flags | 32768U)={4294967322:-24}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, size=1928, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3400] tmp = kmalloc(size, flags | 32768U) [L3402] return (tmp); VAL [\old(flags)=18, \old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, \old(size)=1928, \result={4294967322:-24}, flags=18, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, size=1928, tmp={4294967322:-24}, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3599] RET, EXPR kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u)={4294967322:-24}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3599] return kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u); [L3841] RET, EXPR input_allocate_device() VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, endpoint={4294967323:0}, error=-12, id={4294967329:4294967392}, id={4294967329:4294967392}, input_allocate_device()={4294967322:-24}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, maxp=9, mouse={4294967341:-52}, pipe=0, res_usb_mouse_probe_3=0, tmp___10=9, tmp___11={4294967341:-52}, tmp___7={4294967341:0}, tmp___8=1, tmp___9=42, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3841] input_dev = input_allocate_device() [L3843] COND FALSE !(! mouse) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, endpoint={4294967323:0}, error=-12, id={4294967329:4294967392}, id={4294967329:4294967392}, input_dev={4294967322:-24}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, maxp=9, mouse={4294967341:-52}, pipe=0, res_usb_mouse_probe_3=0, tmp___10=9, tmp___11={4294967341:-52}, tmp___7={4294967341:0}, tmp___8=1, tmp___9=42, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3846] COND FALSE !(! input_dev) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, endpoint={4294967323:0}, error=-12, id={4294967329:4294967392}, id={4294967329:4294967392}, input_dev={4294967322:-24}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, maxp=9, mouse={4294967341:-52}, pipe=0, res_usb_mouse_probe_3=0, tmp___10=9, tmp___11={4294967341:-52}, tmp___7={4294967341:0}, tmp___8=1, tmp___9=42, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3852] CALL, EXPR usb_alloc_coherent(dev, (size_t )8, 32U, & mouse->data_dma) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, \old(res_usb_mouse_probe_3)=0, \old(size)=8, dev={4294967341:0}, dma={4294967341:172}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L4179] void *arbitrary_memory ; [L4180] void *tmp___7 ; VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, \old(res_usb_mouse_probe_3)=0, \old(size)=8, dev={4294967341:0}, dev={4294967341:0}, dma={4294967341:172}, dma={4294967341:172}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=32, res_usb_mouse_probe_3=0, size=8, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L4184] COND TRUE 1 VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, \old(res_usb_mouse_probe_3)=0, \old(size)=8, dev={4294967341:0}, dev={4294967341:0}, dma={4294967341:172}, dma={4294967341:172}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=32, res_usb_mouse_probe_3=0, size=8, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L4187] tmp___7 = ldv_undefined_pointer() [L4188] arbitrary_memory = tmp___7 VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, \old(res_usb_mouse_probe_3)=0, \old(size)=8, arbitrary_memory={4294967401:4294967382}, dev={4294967341:0}, dev={4294967341:0}, dma={4294967341:172}, dma={4294967341:172}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=32, res_usb_mouse_probe_3=0, size=8, tmp___7={4294967401:4294967382}, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L4190] COND FALSE !(! arbitrary_memory) [L4195] ldv_coherent_state = ldv_coherent_state + 1 [L4196] return (arbitrary_memory); VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, \old(res_usb_mouse_probe_3)=0, \old(size)=8, \result={4294967401:4294967382}, arbitrary_memory={4294967401:4294967382}, dev={4294967341:0}, dev={4294967341:0}, dma={4294967341:172}, dma={4294967341:172}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=32, res_usb_mouse_probe_3=0, size=8, tmp___7={4294967401:4294967382}, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3852] RET, EXPR usb_alloc_coherent(dev, (size_t )8, 32U, & mouse->data_dma) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, endpoint={4294967323:0}, error=-12, id={4294967329:4294967392}, id={4294967329:4294967392}, input_dev={4294967322:-24}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=0, maxp=9, mouse={4294967341:-52}, pipe=0, res_usb_mouse_probe_3=0, tmp___10=9, tmp___11={4294967341:-52}, tmp___7={4294967341:0}, tmp___8=1, tmp___9=42, usb_alloc_coherent(dev, (size_t )8, 32U, & mouse->data_dma)={4294967401:4294967382}, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3852] tmp___12 = usb_alloc_coherent(dev, (size_t )8, 32U, & mouse->data_dma) [L3853] mouse->data = (signed char *)tmp___12 [L3855] EXPR mouse->data VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, endpoint={4294967323:0}, error=-12, id={4294967329:4294967392}, id={4294967329:4294967392}, input_dev={4294967322:-24}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=0, maxp=9, mouse={4294967341:-52}, mouse->data={4294967401:4294967382}, pipe=0, res_usb_mouse_probe_3=0, tmp___10=9, tmp___11={4294967341:-52}, tmp___12={4294967401:4294967382}, tmp___7={4294967341:0}, tmp___8=1, tmp___9=42, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3855] COND FALSE !(! mouse->data) [L3861] CALL, EXPR usb_alloc_urb(0, 208U) VAL [\old(iso_packets)=0, \old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L4242] void *arbitrary_memory ; [L4243] void *tmp___7 ; VAL [\old(iso_packets)=0, \old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, \old(res_usb_mouse_probe_3)=0, iso_packets=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=208, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L4247] COND TRUE 1 VAL [\old(iso_packets)=0, \old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, \old(res_usb_mouse_probe_3)=0, iso_packets=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=208, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L4250] tmp___7 = ldv_undefined_pointer() [L4251] arbitrary_memory = tmp___7 VAL [\old(iso_packets)=0, \old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, \old(res_usb_mouse_probe_3)=0, arbitrary_memory={4294967341:0}, iso_packets=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=208, res_usb_mouse_probe_3=0, tmp___7={4294967341:0}, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L4253] COND FALSE !(! arbitrary_memory) [L4258] ldv_urb_state = ldv_urb_state + 1 [L4259] return ((struct urb *)arbitrary_memory); VAL [\old(iso_packets)=0, \old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, \old(res_usb_mouse_probe_3)=0, \result={4294967341:0}, arbitrary_memory={4294967341:0}, iso_packets=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=208, res_usb_mouse_probe_3=0, tmp___7={4294967341:0}, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3861] RET, EXPR usb_alloc_urb(0, 208U) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, endpoint={4294967323:0}, error=-12, id={4294967329:4294967392}, id={4294967329:4294967392}, input_dev={4294967322:-24}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, maxp=9, mouse={4294967341:-52}, pipe=0, res_usb_mouse_probe_3=0, tmp___10=9, tmp___11={4294967341:-52}, tmp___12={4294967401:4294967382}, tmp___7={4294967341:0}, tmp___8=1, tmp___9=42, usb_alloc_urb(0, 208U)={4294967341:0}, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3861] mouse->irq = usb_alloc_urb(0, 208U) [L3863] EXPR mouse->irq VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, endpoint={4294967323:0}, error=-12, id={4294967329:4294967392}, id={4294967329:4294967392}, input_dev={4294967322:-24}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, maxp=9, mouse={4294967341:-52}, mouse->irq={4294967341:0}, pipe=0, res_usb_mouse_probe_3=0, tmp___10=9, tmp___11={4294967341:-52}, tmp___12={4294967401:4294967382}, tmp___7={4294967341:0}, tmp___8=1, tmp___9=42, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3863] COND FALSE !(! mouse->irq) [L3868] mouse->usbdev = dev [L3869] mouse->dev = input_dev [L3870] dev->manufacturer VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, dev->manufacturer={4294967395:4294967394}, endpoint={4294967323:0}, error=-12, id={4294967329:4294967392}, id={4294967329:4294967392}, input_dev={4294967322:-24}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, maxp=9, mouse={4294967341:-52}, pipe=0, res_usb_mouse_probe_3=0, tmp___10=9, tmp___11={4294967341:-52}, tmp___12={4294967401:4294967382}, tmp___7={4294967341:0}, tmp___8=1, tmp___9=42, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3870] COND TRUE dev->manufacturer [L3872] dev->manufacturer [L3877] dev->product VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, dev->product={0:0}, endpoint={4294967323:0}, error=-12, id={4294967329:4294967392}, id={4294967329:4294967392}, input_dev={4294967322:-24}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, maxp=9, mouse={4294967341:-52}, pipe=0, res_usb_mouse_probe_3=0, tmp___10=9, tmp___11={4294967341:-52}, tmp___12={4294967401:4294967382}, tmp___7={4294967341:0}, tmp___8=1, tmp___9=42, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3877] COND FALSE !(dev->product) [L3892] tmp___13 = strlen((char const *)(mouse->name)) [L3894] COND FALSE !(\read(tmp___13)) [L3898] dev->descriptor.idVendor [L3899] dev->descriptor.idProduct [L3903] CALL usb_make_path(dev, mouse->phys, sizeof(mouse->phys)) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, \old(size)=64, buf={4294967341:76}, dev={4294967341:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3481] int actual ; [L3482] int tmp___7 ; [L3486] EXPR dev->bus [L3486] EXPR (dev->bus)->bus_name [L3486] actual = snprintf(buf, size, "usb-%s-%s", (dev->bus)->bus_name, dev->devpath) [L3488] COND TRUE actual >= (int )size [L3489] tmp___7 = -1 VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, \old(size)=64, actual=65, buf={4294967341:76}, buf={4294967341:76}, dev={4294967341:0}, dev={4294967341:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_usb_mouse_probe_3=0, size=64, snprintf(buf, size, "usb-%s-%s", (dev->bus)->bus_name, dev->devpath)=65, tmp___7=-1, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3493] return (tmp___7); VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, \old(size)=64, \result=-1, actual=65, buf={4294967341:76}, buf={4294967341:76}, dev={4294967341:0}, dev={4294967341:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_usb_mouse_probe_3=0, size=64, snprintf(buf, size, "usb-%s-%s", (dev->bus)->bus_name, dev->devpath)=65, tmp___7=-1, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3903] RET usb_make_path(dev, mouse->phys, sizeof(mouse->phys)) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, endpoint={4294967323:0}, error=-12, id={4294967329:4294967392}, id={4294967329:4294967392}, input_dev={4294967322:-24}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, maxp=9, mouse={4294967341:-52}, pipe=0, res_usb_mouse_probe_3=0, tmp___10=9, tmp___11={4294967341:-52}, tmp___12={4294967401:4294967382}, tmp___13=0, tmp___7={4294967341:0}, tmp___8=1, tmp___9=42, usb_make_path(dev, mouse->phys, sizeof(mouse->phys))=-1, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3905] input_dev->name = (char const *)(mouse->name) [L3906] input_dev->phys = (char const *)(mouse->phys) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, endpoint={4294967323:0}, error=-12, id={4294967329:4294967392}, id={4294967329:4294967392}, input_dev={4294967322:-24}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, maxp=9, mouse={4294967341:-52}, pipe=0, res_usb_mouse_probe_3=0, tmp___10=9, tmp___11={4294967341:-52}, tmp___12={4294967401:4294967382}, tmp___13=0, tmp___7={4294967341:0}, tmp___8=1, tmp___9=42, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3907] CALL usb_to_input_id((struct usb_device const *)dev, & input_dev->id) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, id={4294967322:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3663] id->bustype = (__u16 )3 [L3664] EXPR dev->descriptor.idVendor [L3664] id->vendor = (__le16 )dev->descriptor.idVendor [L3665] EXPR dev->descriptor.idProduct [L3665] id->product = (__le16 )dev->descriptor.idProduct [L3666] EXPR dev->descriptor.bcdDevice [L3666] id->version = (__le16 )dev->descriptor.bcdDevice [L3907] RET usb_to_input_id((struct usb_device const *)dev, & input_dev->id) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, endpoint={4294967323:0}, error=-12, id={4294967329:4294967392}, id={4294967329:4294967392}, input_dev={4294967322:-24}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, maxp=9, mouse={4294967341:-52}, pipe=0, res_usb_mouse_probe_3=0, tmp___10=9, tmp___11={4294967341:-52}, tmp___12={4294967401:4294967382}, tmp___13=0, tmp___7={4294967341:0}, tmp___8=1, tmp___9=42, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3908] input_dev->dev.parent = & intf->dev [L3909] input_dev->evbit[0] = (1UL << 1) | (1UL << 2) [L3910] input_dev->keybit[4] = ((1UL << 16) | (1UL << 17)) | (1UL << 18) [L3911] input_dev->relbit[0] = 1UL | (1UL << 1) [L3912] EXPR input_dev->keybit[4] [L3912] input_dev->keybit[4] = input_dev->keybit[4] | ((1UL << 19) | (1UL << 20)) [L3913] EXPR input_dev->relbit[0] [L3913] input_dev->relbit[0] = input_dev->relbit[0] | (1UL << 8) [L3914] CALL input_set_drvdata(input_dev, (void *)mouse) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, data={4294967341:-52}, dev={4294967322:-24}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3914] RET input_set_drvdata(input_dev, (void *)mouse) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, endpoint={4294967323:0}, error=-12, id={4294967329:4294967392}, id={4294967329:4294967392}, input_dev={4294967322:-24}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, maxp=9, mouse={4294967341:-52}, pipe=0, res_usb_mouse_probe_3=0, tmp___10=9, tmp___11={4294967341:-52}, tmp___12={4294967401:4294967382}, tmp___13=0, tmp___7={4294967341:0}, tmp___8=1, tmp___9=42, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3915] input_dev->open = & usb_mouse_open [L3916] input_dev->close = & usb_mouse_close VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, endpoint={4294967323:0}, error=-12, id={4294967329:4294967392}, id={4294967329:4294967392}, input_dev={4294967322:-24}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, maxp=9, mouse={4294967341:-52}, pipe=0, res_usb_mouse_probe_3=0, tmp___10=9, tmp___11={4294967341:-52}, tmp___12={4294967401:4294967382}, tmp___13=0, tmp___7={4294967341:0}, tmp___8=1, tmp___9=42, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3918] COND TRUE maxp > 8 [L3919] tmp___14 = 8 VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, endpoint={4294967323:0}, error=-12, id={4294967329:4294967392}, id={4294967329:4294967392}, input_dev={4294967322:-24}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, maxp=9, mouse={4294967341:-52}, pipe=0, res_usb_mouse_probe_3=0, tmp___10=9, tmp___11={4294967341:-52}, tmp___12={4294967401:4294967382}, tmp___13=0, tmp___14=8, tmp___7={4294967341:0}, tmp___8=1, tmp___9=42, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3924] EXPR mouse->irq [L3924] EXPR mouse->data [L3925] EXPR endpoint->bInterval VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, endpoint={4294967323:0}, endpoint->bInterval=0, error=-12, id={4294967329:4294967392}, id={4294967329:4294967392}, input_dev={4294967322:-24}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, maxp=9, mouse={4294967341:-52}, mouse->data={4294967401:4294967382}, mouse->irq={4294967341:0}, pipe=0, res_usb_mouse_probe_3=0, tmp___10=9, tmp___11={4294967341:-52}, tmp___12={4294967401:4294967382}, tmp___13=0, tmp___14=8, tmp___7={4294967341:0}, tmp___8=1, tmp___9=42, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3924-L3925] CALL usb_fill_int_urb(mouse->irq, dev, (unsigned int )pipe, (void *)mouse->data, tmp___14, & usb_mouse_irq, (void *)mouse, (int )endpoint->bInterval) VAL [\old(buffer_length)=8, \old(interval)=0, \old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(pipe)=0, \old(res_usb_mouse_probe_3)=0, complete_fn={-1:2}, context={4294967341:-52}, dev={4294967341:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_usb_mouse_probe_3=0, transfer_buffer={4294967401:4294967382}, urb={4294967341:0}, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3515] urb->dev = dev [L3516] urb->pipe = pipe [L3517] urb->transfer_buffer = transfer_buffer [L3518] urb->transfer_buffer_length = (u32 )buffer_length [L3519] urb->complete = complete_fn [L3520] urb->context = context [L3521] EXPR dev->speed VAL [\old(buffer_length)=8, \old(interval)=0, \old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(pipe)=0, \old(res_usb_mouse_probe_3)=0, buffer_length=8, complete_fn={-1:2}, complete_fn={-1:2}, context={4294967341:-52}, context={4294967341:-52}, dev={4294967341:0}, dev={4294967341:0}, dev->speed=4294967299, interval=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, pipe=0, res_usb_mouse_probe_3=0, transfer_buffer={4294967401:4294967382}, transfer_buffer={4294967401:4294967382}, urb={4294967341:0}, urb={4294967341:0}, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3521] COND TRUE (unsigned int )dev->speed == 3U [L3522] urb->interval = 1 << (interval - 1) VAL [\old(buffer_length)=8, \old(interval)=0, \old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(pipe)=0, \old(res_usb_mouse_probe_3)=0, buffer_length=8, complete_fn={-1:2}, complete_fn={-1:2}, context={4294967341:-52}, context={4294967341:-52}, dev={4294967341:0}, dev={4294967341:0}, interval=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, pipe=0, res_usb_mouse_probe_3=0, transfer_buffer={4294967401:4294967382}, transfer_buffer={4294967401:4294967382}, urb={4294967341:0}, urb={4294967341:0}, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3529] urb->start_frame = -1 VAL [\old(buffer_length)=8, \old(interval)=0, \old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(pipe)=0, \old(res_usb_mouse_probe_3)=0, buffer_length=8, complete_fn={-1:2}, complete_fn={-1:2}, context={4294967341:-52}, context={4294967341:-52}, dev={4294967341:0}, dev={4294967341:0}, interval=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, pipe=0, res_usb_mouse_probe_3=0, transfer_buffer={4294967401:4294967382}, transfer_buffer={4294967401:4294967382}, urb={4294967341:0}, urb={4294967341:0}, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3924-L3925] RET usb_fill_int_urb(mouse->irq, dev, (unsigned int )pipe, (void *)mouse->data, tmp___14, & usb_mouse_irq, (void *)mouse, (int )endpoint->bInterval) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, endpoint={4294967323:0}, endpoint->bInterval=0, error=-12, id={4294967329:4294967392}, id={4294967329:4294967392}, input_dev={4294967322:-24}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, maxp=9, mouse={4294967341:-52}, mouse->data={4294967401:4294967382}, mouse->irq={4294967341:0}, pipe=0, res_usb_mouse_probe_3=0, tmp___10=9, tmp___11={4294967341:-52}, tmp___12={4294967401:4294967382}, tmp___13=0, tmp___14=8, tmp___7={4294967341:0}, tmp___8=1, tmp___9=42, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3926] EXPR mouse->irq [L3926] EXPR mouse->data_dma [L3926] (mouse->irq)->transfer_dma = mouse->data_dma [L3927] EXPR mouse->irq [L3927] EXPR mouse->irq [L3927] EXPR (mouse->irq)->transfer_flags [L3927] (mouse->irq)->transfer_flags = (mouse->irq)->transfer_flags | 4U [L3928] EXPR mouse->dev [L3928] tmp = (int )input_register_device(mouse->dev) [L3929] error = tmp VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, endpoint={4294967323:0}, error=0, id={4294967329:4294967392}, id={4294967329:4294967392}, input_dev={4294967322:-24}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, maxp=9, mouse={4294967341:-52}, pipe=0, res_usb_mouse_probe_3=0, tmp=0, tmp___10=9, tmp___11={4294967341:-52}, tmp___12={4294967401:4294967382}, tmp___13=0, tmp___14=8, tmp___7={4294967341:0}, tmp___8=1, tmp___9=42, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3931] COND FALSE !(\read(error)) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, endpoint={4294967323:0}, error=0, id={4294967329:4294967392}, id={4294967329:4294967392}, input_dev={4294967322:-24}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, maxp=9, mouse={4294967341:-52}, pipe=0, res_usb_mouse_probe_3=0, tmp=0, tmp___10=9, tmp___11={4294967341:-52}, tmp___12={4294967401:4294967382}, tmp___13=0, tmp___14=8, tmp___7={4294967341:0}, tmp___8=1, tmp___9=42, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3937] CALL usb_set_intfdata(intf, (void *)mouse) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, data={4294967341:-52}, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3937] RET usb_set_intfdata(intf, (void *)mouse) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, dev={4294967341:0}, endpoint={4294967323:0}, error=0, id={4294967329:4294967392}, id={4294967329:4294967392}, input_dev={4294967322:-24}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, maxp=9, mouse={4294967341:-52}, pipe=0, res_usb_mouse_probe_3=0, tmp=0, tmp___10=9, tmp___11={4294967341:-52}, tmp___12={4294967401:4294967382}, tmp___13=0, tmp___14=8, tmp___7={4294967341:0}, tmp___8=1, tmp___9=42, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3939] return (0); VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, \result=0, dev={4294967341:0}, endpoint={4294967323:0}, error=0, id={4294967329:4294967392}, id={4294967329:4294967392}, input_dev={4294967322:-24}, interface={4294967332:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, maxp=9, mouse={4294967341:-52}, pipe=0, res_usb_mouse_probe_3=0, tmp=0, tmp___10=9, tmp___11={4294967341:-52}, tmp___12={4294967401:4294967382}, tmp___13=0, tmp___14=8, tmp___7={4294967341:0}, tmp___8=1, tmp___9=42, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L4111] RET, EXPR usb_mouse_probe(var_group1, var_usb_mouse_probe_3_p1) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_s_usb_mouse_driver_usb_driver=0, ldv_urb_state=1, res_usb_mouse_probe_3=0, tmp___7=0, tmp___8=0, tmp___9=1, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}, usb_mouse_probe(var_group1, var_usb_mouse_probe_3_p1)=0, var_group1={4294967302:0}, var_usb_mouse_probe_3_p1={4294967329:4294967392}] [L4111] res_usb_mouse_probe_3 = usb_mouse_probe(var_group1, var_usb_mouse_probe_3_p1) [L4114] COND FALSE !(\read(res_usb_mouse_probe_3)) [L4119] ldv_s_usb_mouse_driver_usb_driver = ldv_s_usb_mouse_driver_usb_driver + 1 VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_s_usb_mouse_driver_usb_driver=1, ldv_urb_state=1, res_usb_mouse_probe_3=0, tmp___7=0, tmp___8=0, tmp___9=1, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}, var_group1={4294967302:0}, var_usb_mouse_probe_3_p1={4294967329:4294967392}] [L4084] COND TRUE 1 VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_s_usb_mouse_driver_usb_driver=1, ldv_urb_state=1, res_usb_mouse_probe_3=0, tmp___7=0, tmp___8=0, tmp___9=1, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}, var_group1={4294967302:0}, var_usb_mouse_probe_3_p1={4294967329:4294967392}] [L4087] tmp___9 = __VERIFIER_nondet_int() [L4089] COND TRUE \read(tmp___9) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_s_usb_mouse_driver_usb_driver=1, ldv_urb_state=1, res_usb_mouse_probe_3=0, tmp___7=0, tmp___8=0, tmp___9=1, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}, var_group1={4294967302:0}, var_usb_mouse_probe_3_p1={4294967329:4294967392}] [L4098] tmp___8 = __VERIFIER_nondet_int() [L4100] COND FALSE !(tmp___8 == 0) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_s_usb_mouse_driver_usb_driver=1, ldv_urb_state=1, res_usb_mouse_probe_3=0, tmp___7=0, tmp___8=1, tmp___9=1, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}, var_group1={4294967302:0}, var_usb_mouse_probe_3_p1={4294967329:4294967392}] [L4103] COND TRUE tmp___8 == 1 VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_s_usb_mouse_driver_usb_driver=1, ldv_urb_state=1, res_usb_mouse_probe_3=0, tmp___7=0, tmp___8=1, tmp___9=1, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}, var_group1={4294967302:0}, var_usb_mouse_probe_3_p1={4294967329:4294967392}] [L4125] COND TRUE ldv_s_usb_mouse_driver_usb_driver == 1 VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_s_usb_mouse_driver_usb_driver=1, ldv_urb_state=1, res_usb_mouse_probe_3=0, tmp___7=0, tmp___8=1, tmp___9=1, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}, var_group1={4294967302:0}, var_usb_mouse_probe_3_p1={4294967329:4294967392}] [L4127] CALL usb_mouse_disconnect(var_group1) VAL [\old(ldv_coherent_state)=1, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=1, \old(res_usb_mouse_probe_3)=0, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3957] struct usb_mouse *mouse ; [L3958] void *tmp___7 ; [L3959] struct usb_device *tmp___8 ; VAL [\old(ldv_coherent_state)=1, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=1, \old(res_usb_mouse_probe_3)=0, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3963] CALL, EXPR usb_get_intfdata(intf) VAL [\old(ldv_coherent_state)=1, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=1, \old(res_usb_mouse_probe_3)=0, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3451] void *tmp___7 ; [L3455] tmp___7 = dev_get_drvdata((struct device const *)(& intf->dev)) [L3457] return (tmp___7); VAL [\old(ldv_coherent_state)=1, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=1, \old(res_usb_mouse_probe_3)=0, \result={0:0}, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_usb_mouse_probe_3=0, tmp___7={0:0}, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3963] RET, EXPR usb_get_intfdata(intf) VAL [\old(ldv_coherent_state)=1, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=1, \old(res_usb_mouse_probe_3)=0, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_usb_mouse_probe_3=0, usb_get_intfdata(intf)={0:0}, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3963] tmp___7 = usb_get_intfdata(intf) [L3964] mouse = (struct usb_mouse *)tmp___7 VAL [\old(ldv_coherent_state)=1, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=1, \old(res_usb_mouse_probe_3)=0, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mouse={0:0}, res_usb_mouse_probe_3=0, tmp___7={0:0}, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3965] CALL usb_set_intfdata(intf, (void *)0) VAL [\old(ldv_coherent_state)=1, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=1, \old(res_usb_mouse_probe_3)=0, data={0:0}, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3965] RET usb_set_intfdata(intf, (void *)0) VAL [\old(ldv_coherent_state)=1, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=1, \old(res_usb_mouse_probe_3)=0, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mouse={0:0}, res_usb_mouse_probe_3=0, tmp___7={0:0}, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L3967] COND FALSE !(\read(*mouse)) VAL [\old(ldv_coherent_state)=1, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=1, \old(res_usb_mouse_probe_3)=0, intf={4294967302:0}, intf={4294967302:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mouse={0:0}, res_usb_mouse_probe_3=0, tmp___7={0:0}, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L4127] RET usb_mouse_disconnect(var_group1) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_s_usb_mouse_driver_usb_driver=1, ldv_urb_state=1, res_usb_mouse_probe_3=0, tmp___7=0, tmp___8=1, tmp___9=1, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}, var_group1={4294967302:0}, var_usb_mouse_probe_3_p1={4294967329:4294967392}] [L4128] ldv_s_usb_mouse_driver_usb_driver = 0 VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_s_usb_mouse_driver_usb_driver=0, ldv_urb_state=1, res_usb_mouse_probe_3=0, tmp___7=0, tmp___8=1, tmp___9=1, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}, var_group1={4294967302:0}, var_usb_mouse_probe_3_p1={4294967329:4294967392}] [L4084] COND TRUE 1 VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_s_usb_mouse_driver_usb_driver=0, ldv_urb_state=1, res_usb_mouse_probe_3=0, tmp___7=0, tmp___8=1, tmp___9=1, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}, var_group1={4294967302:0}, var_usb_mouse_probe_3_p1={4294967329:4294967392}] [L4087] tmp___9 = __VERIFIER_nondet_int() [L4089] COND FALSE !(\read(tmp___9)) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_s_usb_mouse_driver_usb_driver=0, ldv_urb_state=1, res_usb_mouse_probe_3=0, tmp___7=0, tmp___8=1, tmp___9=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}, var_group1={4294967302:0}, var_usb_mouse_probe_3_p1={4294967329:4294967392}] [L4092] COND FALSE !(! (ldv_s_usb_mouse_driver_usb_driver == 0)) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_s_usb_mouse_driver_usb_driver=0, ldv_urb_state=1, res_usb_mouse_probe_3=0, tmp___7=0, tmp___8=1, tmp___9=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}, var_group1={4294967302:0}, var_usb_mouse_probe_3_p1={4294967329:4294967392}] [L4146] CALL usb_mouse_exit() VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L4146] RET usb_mouse_exit() VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_s_usb_mouse_driver_usb_driver=0, ldv_urb_state=1, res_usb_mouse_probe_3=0, tmp___7=0, tmp___8=1, tmp___9=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}, var_group1={4294967302:0}, var_usb_mouse_probe_3_p1={4294967329:4294967392}] [L4150] CALL ldv_check_final_state() VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L4308] COND FALSE !(ldv_urb_state == 0) VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L4312] CALL ldv_blast_assert() VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] [L4159] __VERIFIER_error() VAL [\old(ldv_coherent_state)=0, \old(LDV_IN_INTERRUPT)=0, \old(ldv_urb_state)=0, \old(res_usb_mouse_probe_3)=0, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_usb_mouse_probe_3=0, usb_mouse_driver={4294967342:0}, usb_mouse_id_table={4294967373:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 30 procedures, 224 locations, 1 error locations. UNSAFE Result, 11.6s OverallTime, 21 OverallIterations, 3 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5350 SDtfs, 3113 SDslu, 11450 SDs, 0 SdLazy, 2494 SolverSat, 775 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 308 GetRequests, 218 SyntacticMatches, 6 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1216occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 691 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2684 NumberOfCodeBlocks, 2684 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2477 ConstructedInterpolants, 0 QuantifiedInterpolants, 567567 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1161 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 21 InterpolantComputations, 20 PerfectInterpolantSequences, 141/144 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-9653033 [2018-11-26 13:14:04,225 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-26 13:14:04,227 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-26 13:14:04,238 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-26 13:14:04,239 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-26 13:14:04,240 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-26 13:14:04,241 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-26 13:14:04,243 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-26 13:14:04,244 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-26 13:14:04,245 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-26 13:14:04,246 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-26 13:14:04,246 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-26 13:14:04,247 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-26 13:14:04,247 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-26 13:14:04,248 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-26 13:14:04,249 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-26 13:14:04,249 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-26 13:14:04,251 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-26 13:14:04,254 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-26 13:14:04,255 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-26 13:14:04,256 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-26 13:14:04,258 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-26 13:14:04,260 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-26 13:14:04,260 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-26 13:14:04,260 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-26 13:14:04,261 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-26 13:14:04,262 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-26 13:14:04,263 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-26 13:14:04,264 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-26 13:14:04,265 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-26 13:14:04,265 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-26 13:14:04,266 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-26 13:14:04,266 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-26 13:14:04,266 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-26 13:14:04,267 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-26 13:14:04,268 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-26 13:14:04,268 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2018-11-26 13:14:04,282 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-26 13:14:04,282 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-26 13:14:04,283 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-26 13:14:04,283 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-26 13:14:04,284 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-26 13:14:04,284 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-26 13:14:04,284 INFO L133 SettingsManager]: * Use SBE=true [2018-11-26 13:14:04,284 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-26 13:14:04,284 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-26 13:14:04,284 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-26 13:14:04,285 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-26 13:14:04,285 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-26 13:14:04,285 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-26 13:14:04,285 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-26 13:14:04,285 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-26 13:14:04,286 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-26 13:14:04,286 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-26 13:14:04,286 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-26 13:14:04,286 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-26 13:14:04,286 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-26 13:14:04,286 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-26 13:14:04,287 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-26 13:14:04,287 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-26 13:14:04,287 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-26 13:14:04,287 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-26 13:14:04,287 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-26 13:14:04,287 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-26 13:14:04,289 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-11-26 13:14:04,289 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-26 13:14:04,290 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-26 13:14:04,290 INFO L133 SettingsManager]: * To the following directory=dump/ 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(__VERIFIER_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 -> 1259db070705cc8318f4cd544a981db9ba453479 [2018-11-26 13:14:04,336 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-26 13:14:04,349 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-26 13:14:04,353 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-26 13:14:04,355 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-26 13:14:04,355 INFO L276 PluginConnector]: CDTParser initialized [2018-11-26 13:14:04,356 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-3.0/usb_urb-drivers-hid-usbhid-usbmouse.ko_false-unreach-call.cil.out.i.pp.i [2018-11-26 13:14:04,406 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6cf4d61d/5104ae3ee7ab4142bc6d388ab909063c/FLAG59637e2d6 [2018-11-26 13:14:04,948 INFO L307 CDTParser]: Found 1 translation units. [2018-11-26 13:14:04,949 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.0/usb_urb-drivers-hid-usbhid-usbmouse.ko_false-unreach-call.cil.out.i.pp.i [2018-11-26 13:14:04,974 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6cf4d61d/5104ae3ee7ab4142bc6d388ab909063c/FLAG59637e2d6 [2018-11-26 13:14:05,377 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6cf4d61d/5104ae3ee7ab4142bc6d388ab909063c [2018-11-26 13:14:05,381 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-26 13:14:05,383 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-26 13:14:05,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-26 13:14:05,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-26 13:14:05,388 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-26 13:14:05,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:14:05" (1/1) ... [2018-11-26 13:14:05,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e0fffd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:14:05, skipping insertion in model container [2018-11-26 13:14:05,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:14:05" (1/1) ... [2018-11-26 13:14:05,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-26 13:14:05,482 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-26 13:14:06,227 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-26 13:14:06,261 INFO L191 MainTranslator]: Completed pre-run [2018-11-26 13:14:06,423 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-26 13:14:06,482 INFO L195 MainTranslator]: Completed translation [2018-11-26 13:14:06,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:14:06 WrapperNode [2018-11-26 13:14:06,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-26 13:14:06,483 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-26 13:14:06,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-26 13:14:06,484 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-26 13:14:06,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:14:06" (1/1) ... [2018-11-26 13:14:06,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:14:06" (1/1) ... [2018-11-26 13:14:06,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-26 13:14:06,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-26 13:14:06,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-26 13:14:06,534 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-26 13:14:06,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:14:06" (1/1) ... [2018-11-26 13:14:06,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:14:06" (1/1) ... [2018-11-26 13:14:06,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:14:06" (1/1) ... [2018-11-26 13:14:06,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:14:06" (1/1) ... [2018-11-26 13:14:06,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:14:06" (1/1) ... [2018-11-26 13:14:06,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:14:06" (1/1) ... [2018-11-26 13:14:06,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:14:06" (1/1) ... [2018-11-26 13:14:06,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-26 13:14:06,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-26 13:14:06,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-26 13:14:06,631 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-26 13:14:06,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:14:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-26 13:14:06,688 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2018-11-26 13:14:06,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2018-11-26 13:14:06,688 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2018-11-26 13:14:06,688 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-26 13:14:06,689 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-26 13:14:06,689 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2018-11-26 13:14:06,689 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2018-11-26 13:14:06,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-26 13:14:06,689 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2018-11-26 13:14:06,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2018-11-26 13:14:06,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-26 13:14:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-26 13:14:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2018-11-26 13:14:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2018-11-26 13:14:06,690 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2018-11-26 13:14:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-11-26 13:14:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2018-11-26 13:14:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2018-11-26 13:14:06,691 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2018-11-26 13:14:06,691 INFO L130 BoogieDeclarations]: Found specification of procedure usb_mouse_init [2018-11-26 13:14:06,691 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_mouse_init [2018-11-26 13:14:06,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-26 13:14:06,691 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_int [2018-11-26 13:14:06,691 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_int [2018-11-26 13:14:06,692 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2018-11-26 13:14:06,692 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2018-11-26 13:14:06,692 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2018-11-26 13:14:06,692 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2018-11-26 13:14:06,693 INFO L130 BoogieDeclarations]: Found specification of procedure usb_mouse_probe [2018-11-26 13:14:06,693 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_mouse_probe [2018-11-26 13:14:06,693 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2018-11-26 13:14:06,694 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2018-11-26 13:14:06,694 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2018-11-26 13:14:06,694 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2018-11-26 13:14:06,694 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2018-11-26 13:14:06,694 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2018-11-26 13:14:06,694 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2018-11-26 13:14:06,694 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2018-11-26 13:14:06,694 INFO L130 BoogieDeclarations]: Found specification of procedure usb_mouse_exit [2018-11-26 13:14:06,695 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_mouse_exit [2018-11-26 13:14:06,695 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2018-11-26 13:14:06,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2018-11-26 13:14:06,695 INFO L130 BoogieDeclarations]: Found specification of procedure usb_mouse_disconnect [2018-11-26 13:14:06,695 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_mouse_disconnect [2018-11-26 13:14:06,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2018-11-26 13:14:06,695 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2018-11-26 13:14:06,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2018-11-26 13:14:06,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-26 13:14:06,696 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2018-11-26 13:14:06,696 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2018-11-26 13:14:06,696 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2018-11-26 13:14:06,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-26 13:14:06,696 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2018-11-26 13:14:06,696 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2018-11-26 13:14:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2018-11-26 13:14:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2018-11-26 13:14:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2018-11-26 13:14:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2018-11-26 13:14:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2018-11-26 13:14:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2018-11-26 13:14:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2018-11-26 13:14:06,697 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2018-11-26 13:14:06,698 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2018-11-26 13:14:06,698 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2018-11-26 13:14:06,698 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2018-11-26 13:14:06,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2018-11-26 13:14:06,698 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2018-11-26 13:14:06,698 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2018-11-26 13:14:06,698 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2018-11-26 13:14:06,698 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2018-11-26 13:14:06,698 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_int_in [2018-11-26 13:14:06,698 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_int_in [2018-11-26 13:14:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2018-11-26 13:14:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2018-11-26 13:14:06,699 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2018-11-26 13:14:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2018-11-26 13:14:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2018-11-26 13:14:06,699 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2018-11-26 13:14:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-26 13:14:06,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-26 13:14:06,701 INFO L130 BoogieDeclarations]: Found specification of procedure usb_maxpacket [2018-11-26 13:14:06,701 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_maxpacket [2018-11-26 13:14:06,701 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2018-11-26 13:14:06,701 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2018-11-26 13:14:06,701 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-11-26 13:14:06,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-11-26 13:14:06,702 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2018-11-26 13:14:06,702 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2018-11-26 13:14:06,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-26 13:14:06,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-26 13:14:06,702 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2018-11-26 13:14:06,985 WARN L645 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-26 13:14:06,986 WARN L610 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-26 13:14:13,264 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-26 13:14:13,264 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-26 13:14:13,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:14:13 BoogieIcfgContainer [2018-11-26 13:14:13,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-26 13:14:13,267 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-26 13:14:13,267 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-26 13:14:13,271 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-26 13:14:13,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 01:14:05" (1/3) ... [2018-11-26 13:14:13,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a88aecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:14:13, skipping insertion in model container [2018-11-26 13:14:13,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:14:06" (2/3) ... [2018-11-26 13:14:13,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a88aecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:14:13, skipping insertion in model container [2018-11-26 13:14:13,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:14:13" (3/3) ... [2018-11-26 13:14:13,275 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-hid-usbhid-usbmouse.ko_false-unreach-call.cil.out.i.pp.i [2018-11-26 13:14:13,286 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-26 13:14:13,295 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-26 13:14:13,314 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-26 13:14:13,344 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-26 13:14:13,345 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-26 13:14:13,345 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-26 13:14:13,345 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-26 13:14:13,346 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-26 13:14:13,346 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-26 13:14:13,346 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-26 13:14:13,346 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-26 13:14:13,346 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-26 13:14:13,368 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states. [2018-11-26 13:14:13,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-26 13:14:13,375 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:13,376 INFO L402 BasicCegarLoop]: 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] [2018-11-26 13:14:13,378 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:13,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:13,383 INFO L82 PathProgramCache]: Analyzing trace with hash -736875403, now seen corresponding path program 1 times [2018-11-26 13:14:13,388 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:14:13,389 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:14:13,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:13,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:14:13,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:14:13,654 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:14:13,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:13,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-26 13:14:13,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-26 13:14:13,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-26 13:14:13,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-26 13:14:13,679 INFO L87 Difference]: Start difference. First operand 220 states. Second operand 3 states. [2018-11-26 13:14:13,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:13,791 INFO L93 Difference]: Finished difference Result 561 states and 738 transitions. [2018-11-26 13:14:13,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-26 13:14:13,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-26 13:14:13,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:13,812 INFO L225 Difference]: With dead ends: 561 [2018-11-26 13:14:13,812 INFO L226 Difference]: Without dead ends: 309 [2018-11-26 13:14:13,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-26 13:14:13,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-11-26 13:14:13,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 305. [2018-11-26 13:14:13,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-26 13:14:13,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 364 transitions. [2018-11-26 13:14:13,899 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 364 transitions. Word has length 23 [2018-11-26 13:14:13,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:13,900 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 364 transitions. [2018-11-26 13:14:13,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-26 13:14:13,900 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 364 transitions. [2018-11-26 13:14:13,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-26 13:14:13,901 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:13,901 INFO L402 BasicCegarLoop]: 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] [2018-11-26 13:14:13,901 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:13,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:13,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1368445644, now seen corresponding path program 1 times [2018-11-26 13:14:13,903 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:14:13,903 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:14:13,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:14,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:14:14,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:14:14,111 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:14:14,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:14,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-26 13:14:14,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-26 13:14:14,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-26 13:14:14,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-26 13:14:14,118 INFO L87 Difference]: Start difference. First operand 305 states and 364 transitions. Second operand 3 states. [2018-11-26 13:14:14,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:14,192 INFO L93 Difference]: Finished difference Result 874 states and 1061 transitions. [2018-11-26 13:14:14,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-26 13:14:14,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-26 13:14:14,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:14,201 INFO L225 Difference]: With dead ends: 874 [2018-11-26 13:14:14,201 INFO L226 Difference]: Without dead ends: 581 [2018-11-26 13:14:14,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-26 13:14:14,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2018-11-26 13:14:14,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 574. [2018-11-26 13:14:14,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-11-26 13:14:14,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 690 transitions. [2018-11-26 13:14:14,257 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 690 transitions. Word has length 24 [2018-11-26 13:14:14,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:14,258 INFO L480 AbstractCegarLoop]: Abstraction has 574 states and 690 transitions. [2018-11-26 13:14:14,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-26 13:14:14,258 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 690 transitions. [2018-11-26 13:14:14,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-26 13:14:14,259 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:14,259 INFO L402 BasicCegarLoop]: 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] [2018-11-26 13:14:14,260 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:14,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:14,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1883917988, now seen corresponding path program 1 times [2018-11-26 13:14:14,261 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:14:14,261 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:14:14,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:14,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:14:14,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:14:14,459 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:14:14,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:14,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-26 13:14:14,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-26 13:14:14,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-26 13:14:14,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-26 13:14:14,463 INFO L87 Difference]: Start difference. First operand 574 states and 690 transitions. Second operand 3 states. [2018-11-26 13:14:14,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:14,533 INFO L93 Difference]: Finished difference Result 1165 states and 1419 transitions. [2018-11-26 13:14:14,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-26 13:14:14,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-26 13:14:14,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:14,539 INFO L225 Difference]: With dead ends: 1165 [2018-11-26 13:14:14,539 INFO L226 Difference]: Without dead ends: 609 [2018-11-26 13:14:14,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-26 13:14:14,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2018-11-26 13:14:14,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2018-11-26 13:14:14,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-11-26 13:14:14,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 736 transitions. [2018-11-26 13:14:14,582 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 736 transitions. Word has length 46 [2018-11-26 13:14:14,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:14,582 INFO L480 AbstractCegarLoop]: Abstraction has 609 states and 736 transitions. [2018-11-26 13:14:14,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-26 13:14:14,582 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 736 transitions. [2018-11-26 13:14:14,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-26 13:14:14,585 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:14,585 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-26 13:14:14,585 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:14,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:14,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1208995629, now seen corresponding path program 1 times [2018-11-26 13:14:14,587 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:14:14,588 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:14:14,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:14,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:14:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:14:14,899 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:14:14,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:14,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-26 13:14:14,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:14:14,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:14:14,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:14,903 INFO L87 Difference]: Start difference. First operand 609 states and 736 transitions. Second operand 5 states. [2018-11-26 13:14:16,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:16,985 INFO L93 Difference]: Finished difference Result 1238 states and 1494 transitions. [2018-11-26 13:14:16,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-26 13:14:16,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2018-11-26 13:14:16,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:16,990 INFO L225 Difference]: With dead ends: 1238 [2018-11-26 13:14:16,990 INFO L226 Difference]: Without dead ends: 644 [2018-11-26 13:14:16,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:16,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2018-11-26 13:14:17,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 621. [2018-11-26 13:14:17,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2018-11-26 13:14:17,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 746 transitions. [2018-11-26 13:14:17,028 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 746 transitions. Word has length 64 [2018-11-26 13:14:17,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:17,028 INFO L480 AbstractCegarLoop]: Abstraction has 621 states and 746 transitions. [2018-11-26 13:14:17,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:14:17,029 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 746 transitions. [2018-11-26 13:14:17,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-26 13:14:17,033 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:17,033 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-26 13:14:17,033 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:17,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:17,034 INFO L82 PathProgramCache]: Analyzing trace with hash -335293934, now seen corresponding path program 1 times [2018-11-26 13:14:17,034 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:14:17,035 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:14:17,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:17,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:14:17,378 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-26 13:14:17,378 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (6)] Exception during sending of exit command (exit): Broken pipe [2018-11-26 13:14:17,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:17,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:14:17,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:14:17,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:14:17,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:14:17,383 INFO L87 Difference]: Start difference. First operand 621 states and 746 transitions. Second operand 6 states. [2018-11-26 13:14:17,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:17,465 INFO L93 Difference]: Finished difference Result 1249 states and 1510 transitions. [2018-11-26 13:14:17,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:14:17,466 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2018-11-26 13:14:17,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:17,470 INFO L225 Difference]: With dead ends: 1249 [2018-11-26 13:14:17,470 INFO L226 Difference]: Without dead ends: 642 [2018-11-26 13:14:17,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:14:17,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-11-26 13:14:17,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 636. [2018-11-26 13:14:17,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2018-11-26 13:14:17,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 759 transitions. [2018-11-26 13:14:17,506 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 759 transitions. Word has length 110 [2018-11-26 13:14:17,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:17,507 INFO L480 AbstractCegarLoop]: Abstraction has 636 states and 759 transitions. [2018-11-26 13:14:17,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:14:17,507 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 759 transitions. [2018-11-26 13:14:17,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-26 13:14:17,511 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:17,511 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-26 13:14:17,511 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:17,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:17,512 INFO L82 PathProgramCache]: Analyzing trace with hash -589922631, now seen corresponding path program 1 times [2018-11-26 13:14:17,514 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:14:17,514 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:14:17,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:18,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:14:18,174 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-26 13:14:18,174 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:14:18,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:18,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-26 13:14:18,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:14:18,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:14:18,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:18,180 INFO L87 Difference]: Start difference. First operand 636 states and 759 transitions. Second operand 5 states. [2018-11-26 13:14:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:18,253 INFO L93 Difference]: Finished difference Result 966 states and 1158 transitions. [2018-11-26 13:14:18,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-26 13:14:18,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2018-11-26 13:14:18,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:18,258 INFO L225 Difference]: With dead ends: 966 [2018-11-26 13:14:18,259 INFO L226 Difference]: Without dead ends: 644 [2018-11-26 13:14:18,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:18,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2018-11-26 13:14:18,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2018-11-26 13:14:18,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2018-11-26 13:14:18,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 767 transitions. [2018-11-26 13:14:18,290 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 767 transitions. Word has length 116 [2018-11-26 13:14:18,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:18,290 INFO L480 AbstractCegarLoop]: Abstraction has 644 states and 767 transitions. [2018-11-26 13:14:18,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:14:18,290 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 767 transitions. [2018-11-26 13:14:18,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-26 13:14:18,293 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:18,294 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-26 13:14:18,294 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:18,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:18,294 INFO L82 PathProgramCache]: Analyzing trace with hash -995031749, now seen corresponding path program 1 times [2018-11-26 13:14:18,295 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:14:18,295 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:14:18,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:18,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:14:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-26 13:14:18,945 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:14:18,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:18,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-26 13:14:18,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:14:18,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:14:18,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:18,951 INFO L87 Difference]: Start difference. First operand 644 states and 767 transitions. Second operand 5 states. [2018-11-26 13:14:19,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:19,009 INFO L93 Difference]: Finished difference Result 1101 states and 1315 transitions. [2018-11-26 13:14:19,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-26 13:14:19,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2018-11-26 13:14:19,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:19,014 INFO L225 Difference]: With dead ends: 1101 [2018-11-26 13:14:19,014 INFO L226 Difference]: Without dead ends: 476 [2018-11-26 13:14:19,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:19,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-11-26 13:14:19,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2018-11-26 13:14:19,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2018-11-26 13:14:19,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 560 transitions. [2018-11-26 13:14:19,032 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 560 transitions. Word has length 120 [2018-11-26 13:14:19,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:19,033 INFO L480 AbstractCegarLoop]: Abstraction has 476 states and 560 transitions. [2018-11-26 13:14:19,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:14:19,033 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 560 transitions. [2018-11-26 13:14:19,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-26 13:14:19,034 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:19,034 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-26 13:14:19,034 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:19,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:19,035 INFO L82 PathProgramCache]: Analyzing trace with hash 249732732, now seen corresponding path program 1 times [2018-11-26 13:14:19,036 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:14:19,036 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:14:19,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:19,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:14:19,710 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-26 13:14:19,710 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:14:19,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:19,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:14:19,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:14:19,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:14:19,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:14:19,716 INFO L87 Difference]: Start difference. First operand 476 states and 560 transitions. Second operand 6 states. [2018-11-26 13:14:27,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:27,269 INFO L93 Difference]: Finished difference Result 1472 states and 1753 transitions. [2018-11-26 13:14:27,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-26 13:14:27,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2018-11-26 13:14:27,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:27,278 INFO L225 Difference]: With dead ends: 1472 [2018-11-26 13:14:27,278 INFO L226 Difference]: Without dead ends: 1125 [2018-11-26 13:14:27,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-26 13:14:27,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2018-11-26 13:14:27,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 948. [2018-11-26 13:14:27,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-11-26 13:14:27,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1123 transitions. [2018-11-26 13:14:27,331 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1123 transitions. Word has length 120 [2018-11-26 13:14:27,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:27,332 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 1123 transitions. [2018-11-26 13:14:27,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:14:27,332 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1123 transitions. [2018-11-26 13:14:27,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-26 13:14:27,334 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:27,335 INFO L402 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:27,335 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:27,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:27,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1326644216, now seen corresponding path program 1 times [2018-11-26 13:14:27,336 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:14:27,336 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:14:27,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:27,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:14:27,667 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-26 13:14:27,668 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:14:27,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:27,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:14:27,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:14:27,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:14:27,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:14:27,672 INFO L87 Difference]: Start difference. First operand 948 states and 1123 transitions. Second operand 6 states. [2018-11-26 13:14:29,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:29,748 INFO L93 Difference]: Finished difference Result 1115 states and 1306 transitions. [2018-11-26 13:14:29,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:14:29,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2018-11-26 13:14:29,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:29,751 INFO L225 Difference]: With dead ends: 1115 [2018-11-26 13:14:29,751 INFO L226 Difference]: Without dead ends: 172 [2018-11-26 13:14:29,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:14:29,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-26 13:14:29,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-11-26 13:14:29,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-26 13:14:29,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 182 transitions. [2018-11-26 13:14:29,764 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 182 transitions. Word has length 124 [2018-11-26 13:14:29,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:29,765 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 182 transitions. [2018-11-26 13:14:29,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:14:29,765 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 182 transitions. [2018-11-26 13:14:29,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-26 13:14:29,767 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:29,767 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-26 13:14:29,767 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:29,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:29,767 INFO L82 PathProgramCache]: Analyzing trace with hash 2132993389, now seen corresponding path program 1 times [2018-11-26 13:14:29,768 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:14:29,768 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:14:29,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:30,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:14:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-26 13:14:30,042 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:14:30,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:30,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-26 13:14:30,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-26 13:14:30,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-26 13:14:30,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-26 13:14:30,045 INFO L87 Difference]: Start difference. First operand 172 states and 182 transitions. Second operand 3 states. [2018-11-26 13:14:30,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:30,062 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2018-11-26 13:14:30,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-26 13:14:30,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2018-11-26 13:14:30,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:30,064 INFO L225 Difference]: With dead ends: 175 [2018-11-26 13:14:30,064 INFO L226 Difference]: Without dead ends: 132 [2018-11-26 13:14:30,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-26 13:14:30,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-26 13:14:30,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-11-26 13:14:30,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-26 13:14:30,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2018-11-26 13:14:30,073 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 133 [2018-11-26 13:14:30,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:30,073 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2018-11-26 13:14:30,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-26 13:14:30,074 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2018-11-26 13:14:30,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-26 13:14:30,075 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:30,075 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-26 13:14:30,076 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:30,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:30,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1289599528, now seen corresponding path program 1 times [2018-11-26 13:14:30,077 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:14:30,077 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:14:30,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:30,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:14:30,721 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-26 13:14:30,721 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:14:30,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:30,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-26 13:14:30,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:14:30,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:14:30,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:30,728 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand 5 states. [2018-11-26 13:14:30,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:30,749 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2018-11-26 13:14:30,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-26 13:14:30,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2018-11-26 13:14:30,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:30,750 INFO L225 Difference]: With dead ends: 132 [2018-11-26 13:14:30,750 INFO L226 Difference]: Without dead ends: 0 [2018-11-26 13:14:30,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:30,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-26 13:14:30,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-26 13:14:30,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-26 13:14:30,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-26 13:14:30,751 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 135 [2018-11-26 13:14:30,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:30,751 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-26 13:14:30,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:14:30,752 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-26 13:14:30,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-26 13:14:30,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-26 13:14:32,000 INFO L448 ceAbstractionStarter]: For program point L3521(lines 3521 3528) no Hoare annotation was computed. [2018-11-26 13:14:32,000 INFO L448 ceAbstractionStarter]: For program point usb_fill_int_urbFINAL(lines 3508 3532) no Hoare annotation was computed. [2018-11-26 13:14:32,000 INFO L448 ceAbstractionStarter]: For program point usb_fill_int_urbEXIT(lines 3508 3532) no Hoare annotation was computed. [2018-11-26 13:14:32,000 INFO L448 ceAbstractionStarter]: For program point L3524(lines 3524 3528) no Hoare annotation was computed. [2018-11-26 13:14:32,000 INFO L451 ceAbstractionStarter]: At program point usb_fill_int_urbENTRY(lines 3508 3532) the Hoare annotation is: true [2018-11-26 13:14:32,001 INFO L448 ceAbstractionStarter]: For program point L3524-2(lines 3521 3528) no Hoare annotation was computed. [2018-11-26 13:14:32,001 INFO L448 ceAbstractionStarter]: For program point L4127-1(line 4127) no Hoare annotation was computed. [2018-11-26 13:14:32,001 INFO L444 ceAbstractionStarter]: At program point L4127(line 4127) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-26 13:14:32,001 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4063 4154) no Hoare annotation was computed. [2018-11-26 13:14:32,001 INFO L448 ceAbstractionStarter]: For program point L4111-1(line 4111) no Hoare annotation was computed. [2018-11-26 13:14:32,001 INFO L444 ceAbstractionStarter]: At program point L4111(line 4111) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= main_~ldv_s_usb_mouse_driver_usb_driver~0 (_ bv0 32)))) [2018-11-26 13:14:32,001 INFO L448 ceAbstractionStarter]: For program point L4103(lines 4103 4139) no Hoare annotation was computed. [2018-11-26 13:14:32,001 INFO L444 ceAbstractionStarter]: At program point L4141(lines 4083 4142) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= (_ bv0 32) ~ldv_coherent_state~0)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-26 13:14:32,002 INFO L448 ceAbstractionStarter]: For program point L4075-1(line 4075) no Hoare annotation was computed. [2018-11-26 13:14:32,002 INFO L444 ceAbstractionStarter]: At program point L4075(line 4075) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0))) [2018-11-26 13:14:32,002 INFO L444 ceAbstractionStarter]: At program point L4104(lines 4103 4139) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= main_~ldv_s_usb_mouse_driver_usb_driver~0 (_ bv0 32)))) [2018-11-26 13:14:32,002 INFO L444 ceAbstractionStarter]: At program point L4137(lines 4084 4140) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= main_~ldv_s_usb_mouse_driver_usb_driver~0 (_ bv0 32)))) [2018-11-26 13:14:32,002 INFO L448 ceAbstractionStarter]: For program point L4100(lines 4100 4139) no Hoare annotation was computed. [2018-11-26 13:14:32,002 INFO L448 ceAbstractionStarter]: For program point L4092(lines 4092 4096) no Hoare annotation was computed. [2018-11-26 13:14:32,002 INFO L448 ceAbstractionStarter]: For program point L4092-1(lines 4089 4096) no Hoare annotation was computed. [2018-11-26 13:14:32,002 INFO L448 ceAbstractionStarter]: For program point L4150(line 4150) no Hoare annotation was computed. [2018-11-26 13:14:32,003 INFO L444 ceAbstractionStarter]: At program point L4146(lines 4071 4153) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= (_ bv0 32) ~ldv_coherent_state~0)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-26 13:14:32,003 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 4107 4138) no Hoare annotation was computed. [2018-11-26 13:14:32,003 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4063 4154) no Hoare annotation was computed. [2018-11-26 13:14:32,003 INFO L448 ceAbstractionStarter]: For program point $Ultimate##19(lines 4107 4138) no Hoare annotation was computed. [2018-11-26 13:14:32,003 INFO L444 ceAbstractionStarter]: At program point L4101(lines 4100 4139) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= main_~ldv_s_usb_mouse_driver_usb_driver~0 (_ bv0 32)))) [2018-11-26 13:14:32,003 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 4063 4154) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0))) [2018-11-26 13:14:32,003 INFO L448 ceAbstractionStarter]: For program point L4089(lines 4089 4096) no Hoare annotation was computed. [2018-11-26 13:14:32,003 INFO L448 ceAbstractionStarter]: For program point L4085(line 4085) no Hoare annotation was computed. [2018-11-26 13:14:32,004 INFO L448 ceAbstractionStarter]: For program point L4114(lines 4114 4118) no Hoare annotation was computed. [2018-11-26 13:14:32,004 INFO L448 ceAbstractionStarter]: For program point L4077(lines 4077 4081) no Hoare annotation was computed. [2018-11-26 13:14:32,004 INFO L448 ceAbstractionStarter]: For program point usb_get_intfdataEXIT(lines 3450 3459) no Hoare annotation was computed. [2018-11-26 13:14:32,004 INFO L451 ceAbstractionStarter]: At program point usb_get_intfdataENTRY(lines 3450 3459) the Hoare annotation is: true [2018-11-26 13:14:32,004 INFO L448 ceAbstractionStarter]: For program point usb_get_intfdataFINAL(lines 3450 3459) no Hoare annotation was computed. [2018-11-26 13:14:32,004 INFO L451 ceAbstractionStarter]: At program point usb_to_input_idENTRY(lines 3659 3669) the Hoare annotation is: true [2018-11-26 13:14:32,004 INFO L448 ceAbstractionStarter]: For program point usb_to_input_idFINAL(lines 3659 3669) no Hoare annotation was computed. [2018-11-26 13:14:32,004 INFO L448 ceAbstractionStarter]: For program point usb_to_input_idEXIT(lines 3659 3669) no Hoare annotation was computed. [2018-11-26 13:14:32,005 INFO L451 ceAbstractionStarter]: At program point L3400(line 3400) the Hoare annotation is: true [2018-11-26 13:14:32,005 INFO L448 ceAbstractionStarter]: For program point kzallocEXIT(lines 3395 3404) no Hoare annotation was computed. [2018-11-26 13:14:32,005 INFO L448 ceAbstractionStarter]: For program point L3400-1(line 3400) no Hoare annotation was computed. [2018-11-26 13:14:32,005 INFO L451 ceAbstractionStarter]: At program point kzallocENTRY(lines 3395 3404) the Hoare annotation is: true [2018-11-26 13:14:32,005 INFO L448 ceAbstractionStarter]: For program point kzallocFINAL(lines 3395 3404) no Hoare annotation was computed. [2018-11-26 13:14:32,005 INFO L448 ceAbstractionStarter]: For program point ldv_assume_stopFINAL(lines 4165 4172) no Hoare annotation was computed. [2018-11-26 13:14:32,005 INFO L451 ceAbstractionStarter]: At program point ldv_assume_stopENTRY(lines 4165 4172) the Hoare annotation is: true [2018-11-26 13:14:32,005 INFO L448 ceAbstractionStarter]: For program point ldv_assume_stopEXIT(lines 4165 4172) no Hoare annotation was computed. [2018-11-26 13:14:32,005 INFO L451 ceAbstractionStarter]: At program point kmallocENTRY(lines 3384 3394) the Hoare annotation is: true [2018-11-26 13:14:32,006 INFO L448 ceAbstractionStarter]: For program point kmallocFINAL(lines 3384 3394) no Hoare annotation was computed. [2018-11-26 13:14:32,006 INFO L448 ceAbstractionStarter]: For program point kmallocEXIT(lines 3384 3394) no Hoare annotation was computed. [2018-11-26 13:14:32,006 INFO L448 ceAbstractionStarter]: For program point usb_endpoint_dir_inEXIT(lines 3408 3414) no Hoare annotation was computed. [2018-11-26 13:14:32,006 INFO L451 ceAbstractionStarter]: At program point usb_endpoint_dir_inENTRY(lines 3408 3414) the Hoare annotation is: true [2018-11-26 13:14:32,006 INFO L448 ceAbstractionStarter]: For program point usb_endpoint_dir_inFINAL(lines 3408 3414) no Hoare annotation was computed. [2018-11-26 13:14:32,006 INFO L448 ceAbstractionStarter]: For program point L4212(lines 4211 4233) no Hoare annotation was computed. [2018-11-26 13:14:32,006 INFO L444 ceAbstractionStarter]: At program point usb_free_coherentENTRY(lines 4206 4239) the Hoare annotation is: (or (not (= (_ bv0 32) ~ldv_urb_state~0)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (not (= (_ bv1 32) |old(~ldv_coherent_state~0)|))) [2018-11-26 13:14:32,006 INFO L448 ceAbstractionStarter]: For program point usb_free_coherentEXIT(lines 4206 4239) no Hoare annotation was computed. [2018-11-26 13:14:32,007 INFO L444 ceAbstractionStarter]: At program point L4225(line 4225) the Hoare annotation is: (or (not (= (_ bv0 32) ~ldv_urb_state~0)) (not (= (_ bv1 32) |old(~ldv_coherent_state~0)|))) [2018-11-26 13:14:32,007 INFO L448 ceAbstractionStarter]: For program point L4225-1(lines 4221 4227) no Hoare annotation was computed. [2018-11-26 13:14:32,007 INFO L448 ceAbstractionStarter]: For program point L4221(lines 4221 4227) no Hoare annotation was computed. [2018-11-26 13:14:32,007 INFO L451 ceAbstractionStarter]: At program point L4215(line 4215) the Hoare annotation is: true [2018-11-26 13:14:32,007 INFO L444 ceAbstractionStarter]: At program point L4211loopEntry(lines 4211 4233) the Hoare annotation is: (or (not (= (_ bv0 32) ~ldv_urb_state~0)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (not (= (_ bv1 32) |old(~ldv_coherent_state~0)|))) [2018-11-26 13:14:32,007 INFO L448 ceAbstractionStarter]: For program point L4213(lines 4211 4233) no Hoare annotation was computed. [2018-11-26 13:14:32,007 INFO L444 ceAbstractionStarter]: At program point L4234(lines 4206 4239) the Hoare annotation is: (or (= (_ bv0 32) ~ldv_coherent_state~0) (not (= (_ bv0 32) ~ldv_urb_state~0)) (not (= (_ bv1 32) |old(~ldv_coherent_state~0)|))) [2018-11-26 13:14:32,008 INFO L448 ceAbstractionStarter]: For program point usb_endpoint_is_int_inFINAL(lines 3422 3445) no Hoare annotation was computed. [2018-11-26 13:14:32,008 INFO L448 ceAbstractionStarter]: For program point L3435(lines 3435 3439) no Hoare annotation was computed. [2018-11-26 13:14:32,008 INFO L448 ceAbstractionStarter]: For program point usb_endpoint_is_int_inEXIT(lines 3422 3445) no Hoare annotation was computed. [2018-11-26 13:14:32,008 INFO L448 ceAbstractionStarter]: For program point L3433-1(line 3433) no Hoare annotation was computed. [2018-11-26 13:14:32,008 INFO L451 ceAbstractionStarter]: At program point L3433(line 3433) the Hoare annotation is: true [2018-11-26 13:14:32,008 INFO L448 ceAbstractionStarter]: For program point L3431-1(lines 3431 3442) no Hoare annotation was computed. [2018-11-26 13:14:32,008 INFO L451 ceAbstractionStarter]: At program point usb_endpoint_is_int_inENTRY(lines 3422 3445) the Hoare annotation is: true [2018-11-26 13:14:32,009 INFO L448 ceAbstractionStarter]: For program point L3431(lines 3431 3442) no Hoare annotation was computed. [2018-11-26 13:14:32,009 INFO L448 ceAbstractionStarter]: For program point L3429-1(line 3429) no Hoare annotation was computed. [2018-11-26 13:14:32,009 INFO L451 ceAbstractionStarter]: At program point L3429(line 3429) the Hoare annotation is: true [2018-11-26 13:14:32,009 INFO L448 ceAbstractionStarter]: For program point usb_alloc_coherentFINAL(lines 4177 4204) no Hoare annotation was computed. [2018-11-26 13:14:32,009 INFO L448 ceAbstractionStarter]: For program point L4190(lines 4190 4194) no Hoare annotation was computed. [2018-11-26 13:14:32,009 INFO L444 ceAbstractionStarter]: At program point L4184loopEntry(lines 4184 4198) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) ~ldv_urb_state~0)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0)) [2018-11-26 13:14:32,009 INFO L444 ceAbstractionStarter]: At program point usb_alloc_coherentENTRY(lines 4177 4204) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) ~ldv_urb_state~0)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0)) [2018-11-26 13:14:32,009 INFO L448 ceAbstractionStarter]: For program point L4185(line 4185) no Hoare annotation was computed. [2018-11-26 13:14:32,010 INFO L448 ceAbstractionStarter]: For program point usb_alloc_coherentEXIT(lines 4177 4204) no Hoare annotation was computed. [2018-11-26 13:14:32,010 INFO L448 ceAbstractionStarter]: For program point L4199(lines 4183 4200) no Hoare annotation was computed. [2018-11-26 13:14:32,010 INFO L448 ceAbstractionStarter]: For program point L4015(lines 4015 4021) no Hoare annotation was computed. [2018-11-26 13:14:32,010 INFO L451 ceAbstractionStarter]: At program point L4012(line 4012) the Hoare annotation is: true [2018-11-26 13:14:32,010 INFO L448 ceAbstractionStarter]: For program point L4015-2(lines 4015 4021) no Hoare annotation was computed. [2018-11-26 13:14:32,010 INFO L448 ceAbstractionStarter]: For program point L4012-1(line 4012) no Hoare annotation was computed. [2018-11-26 13:14:32,010 INFO L448 ceAbstractionStarter]: For program point usb_mouse_initEXIT(lines 4006 4024) no Hoare annotation was computed. [2018-11-26 13:14:32,010 INFO L451 ceAbstractionStarter]: At program point usb_mouse_initENTRY(lines 4006 4024) the Hoare annotation is: true [2018-11-26 13:14:32,011 INFO L448 ceAbstractionStarter]: For program point usb_mouse_initFINAL(lines 4006 4024) no Hoare annotation was computed. [2018-11-26 13:14:32,011 INFO L451 ceAbstractionStarter]: At program point usb_endpoint_xfer_intENTRY(lines 3415 3421) the Hoare annotation is: true [2018-11-26 13:14:32,011 INFO L448 ceAbstractionStarter]: For program point usb_endpoint_xfer_intFINAL(lines 3415 3421) no Hoare annotation was computed. [2018-11-26 13:14:32,011 INFO L448 ceAbstractionStarter]: For program point usb_endpoint_xfer_intEXIT(lines 3415 3421) no Hoare annotation was computed. [2018-11-26 13:14:32,011 INFO L451 ceAbstractionStarter]: At program point usb_set_intfdataENTRY(lines 3462 3471) the Hoare annotation is: true [2018-11-26 13:14:32,011 INFO L448 ceAbstractionStarter]: For program point usb_set_intfdataFINAL(lines 3462 3471) no Hoare annotation was computed. [2018-11-26 13:14:32,011 INFO L448 ceAbstractionStarter]: For program point usb_set_intfdataEXIT(lines 3462 3471) no Hoare annotation was computed. [2018-11-26 13:14:32,011 INFO L451 ceAbstractionStarter]: At program point input_set_drvdataENTRY(lines 3613 3622) the Hoare annotation is: true [2018-11-26 13:14:32,011 INFO L448 ceAbstractionStarter]: For program point input_set_drvdataFINAL(lines 3613 3622) no Hoare annotation was computed. [2018-11-26 13:14:32,012 INFO L448 ceAbstractionStarter]: For program point input_set_drvdataEXIT(lines 3613 3622) no Hoare annotation was computed. [2018-11-26 13:14:32,012 INFO L448 ceAbstractionStarter]: For program point L4288-1(lines 4284 4290) no Hoare annotation was computed. [2018-11-26 13:14:32,012 INFO L451 ceAbstractionStarter]: At program point L4288(line 4288) the Hoare annotation is: true [2018-11-26 13:14:32,012 INFO L448 ceAbstractionStarter]: For program point L4284(lines 4284 4290) no Hoare annotation was computed. [2018-11-26 13:14:32,012 INFO L451 ceAbstractionStarter]: At program point L4278(line 4278) the Hoare annotation is: true [2018-11-26 13:14:32,012 INFO L451 ceAbstractionStarter]: At program point L4274loopEntry(lines 4274 4296) the Hoare annotation is: true [2018-11-26 13:14:32,012 INFO L448 ceAbstractionStarter]: For program point L4276(lines 4274 4296) no Hoare annotation was computed. [2018-11-26 13:14:32,012 INFO L451 ceAbstractionStarter]: At program point L4297(lines 4269 4302) the Hoare annotation is: true [2018-11-26 13:14:32,012 INFO L448 ceAbstractionStarter]: For program point usb_free_urbEXIT(lines 4269 4302) no Hoare annotation was computed. [2018-11-26 13:14:32,013 INFO L451 ceAbstractionStarter]: At program point usb_free_urbENTRY(lines 4269 4302) the Hoare annotation is: true [2018-11-26 13:14:32,013 INFO L448 ceAbstractionStarter]: For program point L4275(lines 4274 4296) no Hoare annotation was computed. [2018-11-26 13:14:32,013 INFO L448 ceAbstractionStarter]: For program point L3937-1(line 3937) no Hoare annotation was computed. [2018-11-26 13:14:32,013 INFO L444 ceAbstractionStarter]: At program point L3937(line 3937) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-26 13:14:32,013 INFO L448 ceAbstractionStarter]: For program point L3863(lines 3863 3867) no Hoare annotation was computed. [2018-11-26 13:14:32,013 INFO L448 ceAbstractionStarter]: For program point L3855(lines 3855 3859) no Hoare annotation was computed. [2018-11-26 13:14:32,013 INFO L444 ceAbstractionStarter]: At program point L3946(line 3946) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= (bvadd |old(~ldv_coherent_state~0)| (_ bv1 32)) ~ldv_coherent_state~0) (= (bvadd usb_mouse_probe_~error~0 (_ bv12 32)) (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-26 13:14:32,013 INFO L448 ceAbstractionStarter]: For program point L3946-1(line 3946) no Hoare annotation was computed. [2018-11-26 13:14:32,014 INFO L444 ceAbstractionStarter]: At program point L3942(line 3942) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-26 13:14:32,014 INFO L448 ceAbstractionStarter]: For program point L3942-1(line 3942) no Hoare annotation was computed. [2018-11-26 13:14:32,014 INFO L448 ceAbstractionStarter]: For program point L3843(lines 3843 3850) no Hoare annotation was computed. [2018-11-26 13:14:32,014 INFO L448 ceAbstractionStarter]: For program point L3839-1(line 3839) no Hoare annotation was computed. [2018-11-26 13:14:32,014 INFO L444 ceAbstractionStarter]: At program point L3839(line 3839) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= (bvadd usb_mouse_probe_~error~0 (_ bv12 32)) (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-26 13:14:32,014 INFO L448 ceAbstractionStarter]: For program point usb_mouse_probeFINAL(lines 3794 3955) no Hoare annotation was computed. [2018-11-26 13:14:32,014 INFO L448 ceAbstractionStarter]: For program point L3835-1(line 3835) no Hoare annotation was computed. [2018-11-26 13:14:32,014 INFO L444 ceAbstractionStarter]: At program point L3835(line 3835) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= (bvadd usb_mouse_probe_~error~0 (_ bv12 32)) (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-26 13:14:32,015 INFO L448 ceAbstractionStarter]: For program point L3827-1(line 3827) no Hoare annotation was computed. [2018-11-26 13:14:32,015 INFO L444 ceAbstractionStarter]: At program point L3827(line 3827) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= (bvadd usb_mouse_probe_~error~0 (_ bv12 32)) (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-26 13:14:32,015 INFO L448 ceAbstractionStarter]: For program point L3918(lines 3918 3922) no Hoare annotation was computed. [2018-11-26 13:14:32,015 INFO L444 ceAbstractionStarter]: At program point L3852(line 3852) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= (bvadd usb_mouse_probe_~error~0 (_ bv12 32)) (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-26 13:14:32,015 INFO L448 ceAbstractionStarter]: For program point L3918-2(lines 3918 3922) no Hoare annotation was computed. [2018-11-26 13:14:32,015 INFO L444 ceAbstractionStarter]: At program point usb_mouse_probeENTRY(lines 3794 3955) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0))) [2018-11-26 13:14:32,015 INFO L444 ceAbstractionStarter]: At program point L3914(line 3914) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-26 13:14:32,016 INFO L448 ceAbstractionStarter]: For program point L3852-1(line 3852) no Hoare annotation was computed. [2018-11-26 13:14:32,016 INFO L448 ceAbstractionStarter]: For program point L3914-1(line 3914) no Hoare annotation was computed. [2018-11-26 13:14:32,016 INFO L448 ceAbstractionStarter]: For program point usb_mouse_probeEXIT(lines 3794 3955) no Hoare annotation was computed. [2018-11-26 13:14:32,016 INFO L448 ceAbstractionStarter]: For program point L3815-1(line 3815) no Hoare annotation was computed. [2018-11-26 13:14:32,016 INFO L444 ceAbstractionStarter]: At program point L3815(line 3815) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0))) [2018-11-26 13:14:32,016 INFO L448 ceAbstractionStarter]: For program point L3877(lines 3877 3890) no Hoare annotation was computed. [2018-11-26 13:14:32,016 INFO L448 ceAbstractionStarter]: For program point L3877-2(lines 3877 3890) no Hoare annotation was computed. [2018-11-26 13:14:32,016 INFO L448 ceAbstractionStarter]: For program point L3931(lines 3931 3935) no Hoare annotation was computed. [2018-11-26 13:14:32,016 INFO L448 ceAbstractionStarter]: For program point L3894(lines 3894 3901) no Hoare annotation was computed. [2018-11-26 13:14:32,017 INFO L448 ceAbstractionStarter]: For program point L3861-1(line 3861) no Hoare annotation was computed. [2018-11-26 13:14:32,017 INFO L451 ceAbstractionStarter]: At program point L3894-2(lines 3894 3901) the Hoare annotation is: true [2018-11-26 13:14:32,017 INFO L444 ceAbstractionStarter]: At program point L3861(line 3861) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= (bvadd |old(~ldv_coherent_state~0)| (_ bv1 32)) ~ldv_coherent_state~0) (= (bvadd usb_mouse_probe_~error~0 (_ bv12 32)) (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-26 13:14:32,017 INFO L448 ceAbstractionStarter]: For program point L3820(lines 3820 3824) no Hoare annotation was computed. [2018-11-26 13:14:32,017 INFO L444 ceAbstractionStarter]: At program point L3948(lines 3813 3954) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= (bvadd usb_mouse_probe_~error~0 (_ bv12 32)) (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-26 13:14:32,017 INFO L444 ceAbstractionStarter]: At program point L3944(lines 3813 3954) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= (bvadd |old(~ldv_coherent_state~0)| (_ bv1 32)) ~ldv_coherent_state~0) (= (bvadd usb_mouse_probe_~error~0 (_ bv12 32)) (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-26 13:14:32,017 INFO L448 ceAbstractionStarter]: For program point L3878(lines 3878 3884) no Hoare annotation was computed. [2018-11-26 13:14:32,017 INFO L448 ceAbstractionStarter]: For program point L3878-2(lines 3878 3884) no Hoare annotation was computed. [2018-11-26 13:14:32,018 INFO L448 ceAbstractionStarter]: For program point L3907-1(line 3907) no Hoare annotation was computed. [2018-11-26 13:14:32,018 INFO L451 ceAbstractionStarter]: At program point L3907(line 3907) the Hoare annotation is: true [2018-11-26 13:14:32,018 INFO L448 ceAbstractionStarter]: For program point L3841-1(line 3841) no Hoare annotation was computed. [2018-11-26 13:14:32,018 INFO L444 ceAbstractionStarter]: At program point L3841(line 3841) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= (bvadd usb_mouse_probe_~error~0 (_ bv12 32)) (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-26 13:14:32,018 INFO L448 ceAbstractionStarter]: For program point L3870(lines 3870 3876) no Hoare annotation was computed. [2018-11-26 13:14:32,018 INFO L448 ceAbstractionStarter]: For program point L3903(line 3903) no Hoare annotation was computed. [2018-11-26 13:14:32,018 INFO L448 ceAbstractionStarter]: For program point L3837-1(line 3837) no Hoare annotation was computed. [2018-11-26 13:14:32,018 INFO L448 ceAbstractionStarter]: For program point L3870-2(lines 3870 3876) no Hoare annotation was computed. [2018-11-26 13:14:32,019 INFO L444 ceAbstractionStarter]: At program point L3932(lines 3813 3954) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-26 13:14:32,019 INFO L444 ceAbstractionStarter]: At program point L3837(line 3837) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= (bvadd usb_mouse_probe_~error~0 (_ bv12 32)) (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-26 13:14:32,019 INFO L448 ceAbstractionStarter]: For program point L3829-1(lines 3829 3833) no Hoare annotation was computed. [2018-11-26 13:14:32,019 INFO L444 ceAbstractionStarter]: At program point L3924(lines 3924 3925) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-26 13:14:32,019 INFO L448 ceAbstractionStarter]: For program point L3829(lines 3829 3833) no Hoare annotation was computed. [2018-11-26 13:14:32,019 INFO L448 ceAbstractionStarter]: For program point L3924-1(lines 3924 3925) no Hoare annotation was computed. [2018-11-26 13:14:32,019 INFO L448 ceAbstractionStarter]: For program point L3846(lines 3846 3850) no Hoare annotation was computed. [2018-11-26 13:14:32,019 INFO L448 ceAbstractionStarter]: For program point L3488(lines 3488 3492) no Hoare annotation was computed. [2018-11-26 13:14:32,020 INFO L448 ceAbstractionStarter]: For program point usb_make_pathEXIT(lines 3480 3495) no Hoare annotation was computed. [2018-11-26 13:14:32,020 INFO L448 ceAbstractionStarter]: For program point L3488-2(lines 3488 3492) no Hoare annotation was computed. [2018-11-26 13:14:32,020 INFO L451 ceAbstractionStarter]: At program point usb_make_pathENTRY(lines 3480 3495) the Hoare annotation is: true [2018-11-26 13:14:32,020 INFO L448 ceAbstractionStarter]: For program point usb_make_pathFINAL(lines 3480 3495) no Hoare annotation was computed. [2018-11-26 13:14:32,020 INFO L451 ceAbstractionStarter]: At program point __create_pipeENTRY(lines 3540 3546) the Hoare annotation is: true [2018-11-26 13:14:32,020 INFO L448 ceAbstractionStarter]: For program point __create_pipeFINAL(lines 3540 3546) no Hoare annotation was computed. [2018-11-26 13:14:32,020 INFO L448 ceAbstractionStarter]: For program point __create_pipeEXIT(lines 3540 3546) no Hoare annotation was computed. [2018-11-26 13:14:32,020 INFO L448 ceAbstractionStarter]: For program point L3599(line 3599) no Hoare annotation was computed. [2018-11-26 13:14:32,020 INFO L448 ceAbstractionStarter]: For program point input_allocate_deviceFINAL(lines 3598 3600) no Hoare annotation was computed. [2018-11-26 13:14:32,021 INFO L451 ceAbstractionStarter]: At program point input_allocate_deviceENTRY(lines 3598 3600) the Hoare annotation is: true [2018-11-26 13:14:32,021 INFO L448 ceAbstractionStarter]: For program point input_allocate_deviceEXIT(lines 3598 3600) no Hoare annotation was computed. [2018-11-26 13:14:32,021 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-26 13:14:32,021 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) [2018-11-26 13:14:32,021 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-26 13:14:32,021 INFO L448 ceAbstractionStarter]: For program point L3578(lines 3578 3584) no Hoare annotation was computed. [2018-11-26 13:14:32,021 INFO L448 ceAbstractionStarter]: For program point L3578-2(lines 3578 3584) no Hoare annotation was computed. [2018-11-26 13:14:32,021 INFO L451 ceAbstractionStarter]: At program point usb_maxpacketENTRY(lines 3547 3597) the Hoare annotation is: true [2018-11-26 13:14:32,021 INFO L448 ceAbstractionStarter]: For program point usb_maxpacketEXIT(lines 3547 3597) no Hoare annotation was computed. [2018-11-26 13:14:32,022 INFO L448 ceAbstractionStarter]: For program point L3562(lines 3562 3568) no Hoare annotation was computed. [2018-11-26 13:14:32,022 INFO L448 ceAbstractionStarter]: For program point L3562-2(lines 3562 3568) no Hoare annotation was computed. [2018-11-26 13:14:32,022 INFO L448 ceAbstractionStarter]: For program point L3557(lines 3557 3589) no Hoare annotation was computed. [2018-11-26 13:14:32,022 INFO L448 ceAbstractionStarter]: For program point usb_maxpacketFINAL(lines 3547 3597) no Hoare annotation was computed. [2018-11-26 13:14:32,022 INFO L448 ceAbstractionStarter]: For program point L3557-2(lines 3555 3596) no Hoare annotation was computed. [2018-11-26 13:14:32,022 INFO L448 ceAbstractionStarter]: For program point interface_to_usbdevFINAL(lines 3472 3479) no Hoare annotation was computed. [2018-11-26 13:14:32,022 INFO L451 ceAbstractionStarter]: At program point interface_to_usbdevENTRY(lines 3472 3479) the Hoare annotation is: true [2018-11-26 13:14:32,022 INFO L448 ceAbstractionStarter]: For program point interface_to_usbdevEXIT(lines 3472 3479) no Hoare annotation was computed. [2018-11-26 13:14:32,023 INFO L451 ceAbstractionStarter]: At program point ldv_check_final_stateENTRY(lines 4304 4324) the Hoare annotation is: true [2018-11-26 13:14:32,023 INFO L444 ceAbstractionStarter]: At program point L4319(line 4319) the Hoare annotation is: (or (not (= (_ bv0 32) ~ldv_coherent_state~0)) (not (= (_ bv0 32) ~ldv_urb_state~0))) [2018-11-26 13:14:32,023 INFO L448 ceAbstractionStarter]: For program point L4319-1(lines 4304 4324) no Hoare annotation was computed. [2018-11-26 13:14:32,023 INFO L448 ceAbstractionStarter]: For program point L4312-1(lines 4307 4323) no Hoare annotation was computed. [2018-11-26 13:14:32,023 INFO L444 ceAbstractionStarter]: At program point L4312(line 4312) the Hoare annotation is: (or (not (= (_ bv0 32) ~ldv_coherent_state~0)) (not (= (_ bv0 32) ~ldv_urb_state~0))) [2018-11-26 13:14:32,023 INFO L448 ceAbstractionStarter]: For program point ldv_check_final_stateEXIT(lines 4304 4324) no Hoare annotation was computed. [2018-11-26 13:14:32,023 INFO L444 ceAbstractionStarter]: At program point usb_alloc_urbENTRY(lines 4241 4267) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (= ~ldv_urb_state~0 (_ bv0 32)) (not (= (_ bv1 32) ~ldv_coherent_state~0))) [2018-11-26 13:14:32,024 INFO L448 ceAbstractionStarter]: For program point L4253(lines 4253 4257) no Hoare annotation was computed. [2018-11-26 13:14:32,024 INFO L444 ceAbstractionStarter]: At program point L4247loopEntry(lines 4247 4261) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (= ~ldv_urb_state~0 (_ bv0 32)) (not (= (_ bv1 32) ~ldv_coherent_state~0))) [2018-11-26 13:14:32,024 INFO L448 ceAbstractionStarter]: For program point L4248(line 4248) no Hoare annotation was computed. [2018-11-26 13:14:32,024 INFO L448 ceAbstractionStarter]: For program point usb_alloc_urbFINAL(lines 4241 4267) no Hoare annotation was computed. [2018-11-26 13:14:32,024 INFO L448 ceAbstractionStarter]: For program point L4262(lines 4246 4263) no Hoare annotation was computed. [2018-11-26 13:14:32,024 INFO L448 ceAbstractionStarter]: For program point usb_alloc_urbEXIT(lines 4241 4267) no Hoare annotation was computed. [2018-11-26 13:14:32,024 INFO L451 ceAbstractionStarter]: At program point usb_registerENTRY(lines 3497 3506) the Hoare annotation is: true [2018-11-26 13:14:32,024 INFO L448 ceAbstractionStarter]: For program point usb_registerEXIT(lines 3497 3506) no Hoare annotation was computed. [2018-11-26 13:14:32,025 INFO L448 ceAbstractionStarter]: For program point usb_registerFINAL(lines 3497 3506) no Hoare annotation was computed. [2018-11-26 13:14:32,025 INFO L448 ceAbstractionStarter]: For program point usb_mouse_exitEXIT(lines 4027 4036) no Hoare annotation was computed. [2018-11-26 13:14:32,025 INFO L451 ceAbstractionStarter]: At program point usb_mouse_exitENTRY(lines 4027 4036) the Hoare annotation is: true [2018-11-26 13:14:32,025 INFO L448 ceAbstractionStarter]: For program point usb_mouse_exitFINAL(lines 4027 4036) no Hoare annotation was computed. [2018-11-26 13:14:32,025 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-26 13:14:32,025 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~ldv_urb_state~0 (_ bv0 32)) (= (_ bv0 32) ~ldv_coherent_state~0)) [2018-11-26 13:14:32,025 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-26 13:14:32,026 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-26 13:14:32,026 INFO L448 ceAbstractionStarter]: For program point L3967-1(lines 3956 3981) no Hoare annotation was computed. [2018-11-26 13:14:32,026 INFO L448 ceAbstractionStarter]: For program point L3965-1(lines 3961 3980) no Hoare annotation was computed. [2018-11-26 13:14:32,026 INFO L451 ceAbstractionStarter]: At program point L3965(line 3965) the Hoare annotation is: true [2018-11-26 13:14:32,026 INFO L448 ceAbstractionStarter]: For program point L3963-1(line 3963) no Hoare annotation was computed. [2018-11-26 13:14:32,026 INFO L451 ceAbstractionStarter]: At program point L3963(line 3963) the Hoare annotation is: true [2018-11-26 13:14:32,026 INFO L448 ceAbstractionStarter]: For program point usb_mouse_disconnectEXIT(lines 3956 3981) no Hoare annotation was computed. [2018-11-26 13:14:32,026 INFO L451 ceAbstractionStarter]: At program point usb_mouse_disconnectENTRY(lines 3956 3981) the Hoare annotation is: true [2018-11-26 13:14:32,027 INFO L451 ceAbstractionStarter]: At program point L3972(line 3972) the Hoare annotation is: true [2018-11-26 13:14:32,027 INFO L448 ceAbstractionStarter]: For program point L3973-1(line 3973) no Hoare annotation was computed. [2018-11-26 13:14:32,027 INFO L451 ceAbstractionStarter]: At program point L3973(line 3973) the Hoare annotation is: true [2018-11-26 13:14:32,027 INFO L448 ceAbstractionStarter]: For program point L3971-1(line 3971) no Hoare annotation was computed. [2018-11-26 13:14:32,027 INFO L451 ceAbstractionStarter]: At program point L3971(line 3971) the Hoare annotation is: true [2018-11-26 13:14:32,027 INFO L448 ceAbstractionStarter]: For program point L3972-1(line 3972) no Hoare annotation was computed. [2018-11-26 13:14:32,027 INFO L451 ceAbstractionStarter]: At program point ldv_blast_assertENTRY(lines 4155 4161) the Hoare annotation is: true [2018-11-26 13:14:32,027 INFO L448 ceAbstractionStarter]: For program point ldv_blast_assertEXIT(lines 4155 4161) no Hoare annotation was computed. [2018-11-26 13:14:32,027 INFO L448 ceAbstractionStarter]: For program point ldv_blast_assertFINAL(lines 4155 4161) no Hoare annotation was computed. [2018-11-26 13:14:32,028 INFO L448 ceAbstractionStarter]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4159) no Hoare annotation was computed. [2018-11-26 13:14:32,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 01:14:32 BoogieIcfgContainer [2018-11-26 13:14:32,052 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-26 13:14:32,053 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-26 13:14:32,053 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-26 13:14:32,053 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-26 13:14:32,054 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:14:13" (3/4) ... [2018-11-26 13:14:32,059 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-26 13:14:32,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_fill_int_urb [2018-11-26 13:14:32,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-26 13:14:32,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_get_intfdata [2018-11-26 13:14:32,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_to_input_id [2018-11-26 13:14:32,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2018-11-26 13:14:32,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2018-11-26 13:14:32,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2018-11-26 13:14:32,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_endpoint_dir_in [2018-11-26 13:14:32,069 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_coherent [2018-11-26 13:14:32,069 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_endpoint_is_int_in [2018-11-26 13:14:32,069 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_alloc_coherent [2018-11-26 13:14:32,069 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_mouse_init [2018-11-26 13:14:32,069 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_endpoint_xfer_int [2018-11-26 13:14:32,069 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_set_intfdata [2018-11-26 13:14:32,069 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure input_set_drvdata [2018-11-26 13:14:32,069 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2018-11-26 13:14:32,070 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_mouse_probe [2018-11-26 13:14:32,070 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_make_path [2018-11-26 13:14:32,070 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __create_pipe [2018-11-26 13:14:32,070 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure input_allocate_device [2018-11-26 13:14:32,070 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-26 13:14:32,070 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_maxpacket [2018-11-26 13:14:32,070 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure interface_to_usbdev [2018-11-26 13:14:32,070 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_final_state [2018-11-26 13:14:32,071 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_alloc_urb [2018-11-26 13:14:32,071 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_register [2018-11-26 13:14:32,071 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_mouse_exit [2018-11-26 13:14:32,072 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_mouse_disconnect [2018-11-26 13:14:32,072 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2018-11-26 13:14:32,087 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 138 nodes and edges [2018-11-26 13:14:32,089 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 59 nodes and edges [2018-11-26 13:14:32,091 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2018-11-26 13:14:32,092 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-11-26 13:14:32,093 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-26 13:14:32,094 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-26 13:14:32,128 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv32 == \old(ldv_coherent_state)) || (ldv_urb_state == 0bv32 && 0bv32 == ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state)) [2018-11-26 13:14:32,129 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv32 == \old(ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state))) || ((ldv_urb_state == 0bv32 && \old(ldv_coherent_state) == ldv_coherent_state) && ldv_s_usb_mouse_driver_usb_driver == 0bv32) [2018-11-26 13:14:32,129 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv32 == \old(ldv_coherent_state)) || (ldv_urb_state == 0bv32 && 0bv32 == ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state)) [2018-11-26 13:14:32,130 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0bv32 == ldv_coherent_state || !(0bv32 == ldv_urb_state)) || !(1bv32 == \old(ldv_coherent_state)) [2018-11-26 13:14:32,130 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv32 == \old(ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state))) || ((ldv_urb_state == 0bv32 && \old(ldv_coherent_state) == ldv_coherent_state) && ldv_s_usb_mouse_driver_usb_driver == 0bv32) [2018-11-26 13:14:32,130 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv32 == \old(ldv_coherent_state)) || ((ldv_urb_state == 0bv32 && ~bvadd16(\old(ldv_coherent_state), 1bv32) == ldv_coherent_state) && ~bvadd16(error, 12bv32) == 0bv32)) || !(0bv32 == \old(ldv_urb_state)) [2018-11-26 13:14:32,130 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv32 == \old(ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state))) || ((ldv_urb_state == 0bv32 && \old(ldv_coherent_state) == ldv_coherent_state) && ldv_s_usb_mouse_driver_usb_driver == 0bv32) [2018-11-26 13:14:32,131 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv32 == \old(ldv_coherent_state)) || ((ldv_urb_state == 0bv32 && \old(ldv_coherent_state) == ldv_coherent_state) && ~bvadd16(error, 12bv32) == 0bv32)) || !(0bv32 == \old(ldv_urb_state)) [2018-11-26 13:14:32,131 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv32 == ldv_urb_state) || \old(ldv_coherent_state) == ldv_coherent_state) || !(1bv32 == \old(ldv_coherent_state)) [2018-11-26 13:14:32,134 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv32 == \old(ldv_coherent_state)) || !(0bv32 == ldv_urb_state)) || \old(ldv_coherent_state) == ldv_coherent_state [2018-11-26 13:14:32,135 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv32 == \old(ldv_urb_state)) || ldv_urb_state == 0bv32) || !(1bv32 == ldv_coherent_state) [2018-11-26 13:14:32,137 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state)) [2018-11-26 13:14:32,222 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-26 13:14:32,222 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-26 13:14:32,223 INFO L168 Benchmark]: Toolchain (without parser) took 26841.39 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 326.1 MB). Free memory was 944.3 MB in the beginning and 854.6 MB in the end (delta: 89.7 MB). Peak memory consumption was 415.8 MB. Max. memory is 11.5 GB. [2018-11-26 13:14:32,224 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-26 13:14:32,224 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1099.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -136.7 MB). Peak memory consumption was 81.2 MB. Max. memory is 11.5 GB. [2018-11-26 13:14:32,225 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-26 13:14:32,225 INFO L168 Benchmark]: Boogie Preprocessor took 96.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-11-26 13:14:32,225 INFO L168 Benchmark]: RCFGBuilder took 6634.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 937.7 MB in the end (delta: 136.3 MB). Peak memory consumption was 136.3 MB. Max. memory is 11.5 GB. [2018-11-26 13:14:32,226 INFO L168 Benchmark]: TraceAbstraction took 18784.99 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 170.4 MB). Free memory was 937.7 MB in the beginning and 873.0 MB in the end (delta: 64.7 MB). Peak memory consumption was 235.1 MB. Max. memory is 11.5 GB. [2018-11-26 13:14:32,226 INFO L168 Benchmark]: Witness Printer took 169.78 ms. Allocated memory is still 1.4 GB. Free memory was 873.0 MB in the beginning and 854.6 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-11-26 13:14:32,228 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1099.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -136.7 MB). Peak memory consumption was 81.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 96.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 6634.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 937.7 MB in the end (delta: 136.3 MB). Peak memory consumption was 136.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18784.99 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 170.4 MB). Free memory was 937.7 MB in the beginning and 873.0 MB in the end (delta: 64.7 MB). Peak memory consumption was 235.1 MB. Max. memory is 11.5 GB. * Witness Printer took 169.78 ms. Allocated memory is still 1.4 GB. Free memory was 873.0 MB in the beginning and 854.6 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4159]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4084]: Loop Invariant Derived loop invariant: (!(0bv32 == \old(ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state))) || ((ldv_urb_state == 0bv32 && \old(ldv_coherent_state) == ldv_coherent_state) && ldv_s_usb_mouse_driver_usb_driver == 0bv32) - InvariantResult [Line: 3813]: Loop Invariant Derived loop invariant: (!(0bv32 == \old(ldv_coherent_state)) || ((ldv_urb_state == 0bv32 && ~bvadd16(\old(ldv_coherent_state), 1bv32) == ldv_coherent_state) && ~bvadd16(error, 12bv32) == 0bv32)) || !(0bv32 == \old(ldv_urb_state)) - InvariantResult [Line: 3813]: Loop Invariant Derived loop invariant: !(0bv32 == \old(ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state)) - InvariantResult [Line: 4103]: Loop Invariant Derived loop invariant: (!(0bv32 == \old(ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state))) || ((ldv_urb_state == 0bv32 && \old(ldv_coherent_state) == ldv_coherent_state) && ldv_s_usb_mouse_driver_usb_driver == 0bv32) - InvariantResult [Line: 4071]: Loop Invariant Derived loop invariant: (!(0bv32 == \old(ldv_coherent_state)) || (ldv_urb_state == 0bv32 && 0bv32 == ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state)) - InvariantResult [Line: 4247]: Loop Invariant Derived loop invariant: (!(0bv32 == \old(ldv_urb_state)) || ldv_urb_state == 0bv32) || !(1bv32 == ldv_coherent_state) - InvariantResult [Line: 4184]: Loop Invariant Derived loop invariant: (!(0bv32 == \old(ldv_coherent_state)) || !(0bv32 == ldv_urb_state)) || \old(ldv_coherent_state) == ldv_coherent_state - InvariantResult [Line: 4100]: Loop Invariant Derived loop invariant: (!(0bv32 == \old(ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state))) || ((ldv_urb_state == 0bv32 && \old(ldv_coherent_state) == ldv_coherent_state) && ldv_s_usb_mouse_driver_usb_driver == 0bv32) - InvariantResult [Line: 4211]: Loop Invariant Derived loop invariant: (!(0bv32 == ldv_urb_state) || \old(ldv_coherent_state) == ldv_coherent_state) || !(1bv32 == \old(ldv_coherent_state)) - InvariantResult [Line: 3813]: Loop Invariant Derived loop invariant: (!(0bv32 == \old(ldv_coherent_state)) || ((ldv_urb_state == 0bv32 && \old(ldv_coherent_state) == ldv_coherent_state) && ~bvadd16(error, 12bv32) == 0bv32)) || !(0bv32 == \old(ldv_urb_state)) - InvariantResult [Line: 4274]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4165]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4083]: Loop Invariant Derived loop invariant: (!(0bv32 == \old(ldv_coherent_state)) || (ldv_urb_state == 0bv32 && 0bv32 == ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state)) - InvariantResult [Line: 4206]: Loop Invariant Derived loop invariant: (0bv32 == ldv_coherent_state || !(0bv32 == ldv_urb_state)) || !(1bv32 == \old(ldv_coherent_state)) - InvariantResult [Line: 4269]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 30 procedures, 224 locations, 1 error locations. SAFE Result, 18.6s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 12.3s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 2161 SDtfs, 971 SDslu, 4362 SDs, 0 SdLazy, 718 SolverSat, 208 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1009 GetRequests, 976 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=948occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 217 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 78 LocationsWithAnnotation, 1984 PreInvPairs, 2090 NumberOfFragments, 603 HoareAnnotationTreeSize, 1984 FomulaSimplifications, 76 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 78 FomulaSimplificationsInter, 540 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1015 NumberOfCodeBlocks, 1015 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1004 ConstructedInterpolants, 0 QuantifiedInterpolants, 164236 SizeOfPredicates, 33 NumberOfNonLiveVariables, 4716 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 66/66 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...