./Ultimate.py --spec ../../sv-benchmarks/c/Systems_DeviceDriversLinux64_ReachSafety.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i.pp.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_88932ab3-79aa-4282-85da-30258cb257a0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_88932ab3-79aa-4282-85da-30258cb257a0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_88932ab3-79aa-4282-85da-30258cb257a0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_88932ab3-79aa-4282-85da-30258cb257a0/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i.pp.i -s /tmp/vcloud-vcloud-master/worker/working_dir_88932ab3-79aa-4282-85da-30258cb257a0/bin-2019/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_88932ab3-79aa-4282-85da-30258cb257a0/bin-2019/uautomizer --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 c4ab3a1b7a928c9fbfa3f31e196dab10da7fc09a ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 16:19:06,214 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:19:06,216 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:19:06,222 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:19:06,222 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:19:06,223 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:19:06,224 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:19:06,225 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:19:06,226 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:19:06,227 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:19:06,227 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:19:06,227 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:19:06,228 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:19:06,229 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:19:06,230 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:19:06,230 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:19:06,230 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:19:06,231 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:19:06,232 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:19:06,234 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:19:06,234 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:19:06,235 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:19:06,236 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:19:06,237 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:19:06,237 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:19:06,237 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:19:06,238 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:19:06,239 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:19:06,239 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:19:06,240 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:19:06,240 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:19:06,241 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:19:06,241 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:19:06,241 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:19:06,242 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:19:06,242 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:19:06,243 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_88932ab3-79aa-4282-85da-30258cb257a0/bin-2019/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-18 16:19:06,252 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:19:06,253 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:19:06,253 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:19:06,253 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 16:19:06,254 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:19:06,254 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:19:06,254 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 16:19:06,254 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:19:06,254 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:19:06,255 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:19:06,255 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 16:19:06,255 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:19:06,255 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 16:19:06,255 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:19:06,255 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:19:06,255 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 16:19:06,256 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:19:06,256 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:19:06,256 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:19:06,256 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 16:19:06,256 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:19:06,256 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:19:06,256 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:19:06,256 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 16:19:06,257 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 16:19:06,257 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:19:06,257 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 16:19:06,257 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 16:19:06,257 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_88932ab3-79aa-4282-85da-30258cb257a0/bin-2019/uautomizer 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 -> c4ab3a1b7a928c9fbfa3f31e196dab10da7fc09a [2018-11-18 16:19:06,281 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:19:06,290 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:19:06,293 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:19:06,294 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:19:06,294 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:19:06,295 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_88932ab3-79aa-4282-85da-30258cb257a0/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i.pp.i [2018-11-18 16:19:06,341 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_88932ab3-79aa-4282-85da-30258cb257a0/bin-2019/uautomizer/data/a57fff179/9c0456dd0c0d4899a6b25d3fbab150d8/FLAG9dd481259 [2018-11-18 16:19:06,810 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:19:06,810 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_88932ab3-79aa-4282-85da-30258cb257a0/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i.pp.i [2018-11-18 16:19:06,826 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_88932ab3-79aa-4282-85da-30258cb257a0/bin-2019/uautomizer/data/a57fff179/9c0456dd0c0d4899a6b25d3fbab150d8/FLAG9dd481259 [2018-11-18 16:19:07,100 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_88932ab3-79aa-4282-85da-30258cb257a0/bin-2019/uautomizer/data/a57fff179/9c0456dd0c0d4899a6b25d3fbab150d8 [2018-11-18 16:19:07,103 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:19:07,104 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 16:19:07,104 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:19:07,104 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:19:07,106 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:19:07,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:19:07" (1/1) ... [2018-11-18 16:19:07,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c241da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:07, skipping insertion in model container [2018-11-18 16:19:07,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:19:07" (1/1) ... [2018-11-18 16:19:07,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:19:07,162 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:19:07,904 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:19:07,962 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:19:08,219 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:19:08,273 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:19:08,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:08 WrapperNode [2018-11-18 16:19:08,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:19:08,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:19:08,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:19:08,274 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:19:08,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:08" (1/1) ... [2018-11-18 16:19:08,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:08" (1/1) ... [2018-11-18 16:19:08,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:08" (1/1) ... [2018-11-18 16:19:08,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:08" (1/1) ... [2018-11-18 16:19:08,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:08" (1/1) ... [2018-11-18 16:19:08,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:08" (1/1) ... [2018-11-18 16:19:08,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:08" (1/1) ... [2018-11-18 16:19:08,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:19:08,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:19:08,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:19:08,360 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:19:08,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88932ab3-79aa-4282-85da-30258cb257a0/bin-2019/uautomizer/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-18 16:19:08,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 16:19:08,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:19:08,420 INFO L138 BoogieDeclarations]: Found implementation of procedure __le16_to_cpup [2018-11-18 16:19:08,420 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2018-11-18 16:19:08,420 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2018-11-18 16:19:08,420 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2018-11-18 16:19:08,421 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2018-11-18 16:19:08,421 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2018-11-18 16:19:08,421 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2018-11-18 16:19:08,421 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2018-11-18 16:19:08,421 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2018-11-18 16:19:08,421 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2018-11-18 16:19:08,421 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2018-11-18 16:19:08,421 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2018-11-18 16:19:08,422 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2018-11-18 16:19:08,422 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2018-11-18 16:19:08,422 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2018-11-18 16:19:08,422 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2018-11-18 16:19:08,422 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2018-11-18 16:19:08,422 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_le16 [2018-11-18 16:19:08,422 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_irq [2018-11-18 16:19:08,424 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_open [2018-11-18 16:19:08,424 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_close [2018-11-18 16:19:08,424 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_probe [2018-11-18 16:19:08,424 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_disconnect [2018-11-18 16:19:08,425 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2018-11-18 16:19:08,425 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2018-11-18 16:19:08,425 INFO L138 BoogieDeclarations]: Found implementation of procedure init_module [2018-11-18 16:19:08,425 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup_module [2018-11-18 16:19:08,425 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 16:19:08,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2018-11-18 16:19:08,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2018-11-18 16:19:08,425 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2018-11-18 16:19:08,426 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2018-11-18 16:19:08,426 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2018-11-18 16:19:08,426 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2018-11-18 16:19:08,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-11-18 16:19:08,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 16:19:08,426 INFO L130 BoogieDeclarations]: Found specification of procedure __le16_to_cpup [2018-11-18 16:19:08,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 16:19:08,427 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2018-11-18 16:19:08,427 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2018-11-18 16:19:08,427 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2018-11-18 16:19:08,427 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2018-11-18 16:19:08,427 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2018-11-18 16:19:08,427 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2018-11-18 16:19:08,427 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2018-11-18 16:19:08,427 INFO L130 BoogieDeclarations]: Found specification of procedure init_module [2018-11-18 16:19:08,428 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup_module [2018-11-18 16:19:08,428 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2018-11-18 16:19:08,428 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2018-11-18 16:19:08,428 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2018-11-18 16:19:08,428 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2018-11-18 16:19:08,428 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2018-11-18 16:19:08,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 16:19:08,428 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2018-11-18 16:19:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 16:19:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2018-11-18 16:19:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2018-11-18 16:19:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2018-11-18 16:19:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2018-11-18 16:19:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 16:19:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 16:19:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2018-11-18 16:19:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2018-11-18 16:19:08,430 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2018-11-18 16:19:08,430 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2018-11-18 16:19:08,430 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2018-11-18 16:19:08,430 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2018-11-18 16:19:08,430 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2018-11-18 16:19:08,430 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2018-11-18 16:19:08,430 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2018-11-18 16:19:08,430 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2018-11-18 16:19:08,430 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2018-11-18 16:19:08,433 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2018-11-18 16:19:08,433 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2018-11-18 16:19:08,434 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2018-11-18 16:19:08,434 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2018-11-18 16:19:08,434 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2018-11-18 16:19:08,434 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2018-11-18 16:19:08,434 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2018-11-18 16:19:08,434 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2018-11-18 16:19:08,434 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_le16 [2018-11-18 16:19:08,434 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_irq [2018-11-18 16:19:08,434 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_open [2018-11-18 16:19:08,435 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_close [2018-11-18 16:19:08,435 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_probe [2018-11-18 16:19:08,435 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_disconnect [2018-11-18 16:19:08,435 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2018-11-18 16:19:08,435 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2018-11-18 16:19:08,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-11-18 16:19:08,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2018-11-18 16:19:08,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-11-18 16:19:08,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 16:19:08,436 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 16:19:08,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2018-11-18 16:19:08,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2018-11-18 16:19:08,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2018-11-18 16:19:08,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 16:19:08,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 16:19:08,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:19:08,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 16:19:08,824 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 16:19:08,825 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 16:19:09,017 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 16:19:09,017 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 16:19:11,354 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:19:11,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:19:11 BoogieIcfgContainer [2018-11-18 16:19:11,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:19:11,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 16:19:11,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 16:19:11,357 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 16:19:11,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:19:07" (1/3) ... [2018-11-18 16:19:11,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4f22a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:19:11, skipping insertion in model container [2018-11-18 16:19:11,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:08" (2/3) ... [2018-11-18 16:19:11,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4f22a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:19:11, skipping insertion in model container [2018-11-18 16:19:11,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:19:11" (3/3) ... [2018-11-18 16:19:11,360 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i.pp.i [2018-11-18 16:19:11,366 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 16:19:11,372 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 16:19:11,382 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 16:19:11,406 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 16:19:11,407 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 16:19:11,407 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 16:19:11,407 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 16:19:11,407 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:19:11,408 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:19:11,408 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 16:19:11,408 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:19:11,408 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 16:19:11,424 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states. [2018-11-18 16:19:11,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 16:19:11,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:19:11,429 INFO L375 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-18 16:19:11,431 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:19:11,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:11,435 INFO L82 PathProgramCache]: Analyzing trace with hash -151304490, now seen corresponding path program 1 times [2018-11-18 16:19:11,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:11,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:11,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:11,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:11,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:11,703 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-18 16:19:11,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:19:11,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:19:11,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:19:11,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:19:11,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:19:11,717 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 3 states. [2018-11-18 16:19:11,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:19:11,825 INFO L93 Difference]: Finished difference Result 489 states and 632 transitions. [2018-11-18 16:19:11,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:19:11,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 16:19:11,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:19:11,839 INFO L225 Difference]: With dead ends: 489 [2018-11-18 16:19:11,839 INFO L226 Difference]: Without dead ends: 313 [2018-11-18 16:19:11,845 INFO L604 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-18 16:19:11,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-11-18 16:19:11,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 309. [2018-11-18 16:19:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-11-18 16:19:11,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 362 transitions. [2018-11-18 16:19:11,902 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 362 transitions. Word has length 23 [2018-11-18 16:19:11,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:19:11,902 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 362 transitions. [2018-11-18 16:19:11,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:19:11,903 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 362 transitions. [2018-11-18 16:19:11,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 16:19:11,903 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:19:11,903 INFO L375 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-18 16:19:11,904 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:19:11,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:11,904 INFO L82 PathProgramCache]: Analyzing trace with hash -395615952, now seen corresponding path program 1 times [2018-11-18 16:19:11,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:11,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:11,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:11,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:11,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:11,995 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-18 16:19:11,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:19:11,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:19:11,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:19:11,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:19:11,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:19:11,997 INFO L87 Difference]: Start difference. First operand 309 states and 362 transitions. Second operand 3 states. [2018-11-18 16:19:12,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:19:12,046 INFO L93 Difference]: Finished difference Result 886 states and 1055 transitions. [2018-11-18 16:19:12,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:19:12,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 16:19:12,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:19:12,051 INFO L225 Difference]: With dead ends: 886 [2018-11-18 16:19:12,051 INFO L226 Difference]: Without dead ends: 589 [2018-11-18 16:19:12,054 INFO L604 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-18 16:19:12,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-11-18 16:19:12,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 582. [2018-11-18 16:19:12,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-11-18 16:19:12,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 686 transitions. [2018-11-18 16:19:12,092 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 686 transitions. Word has length 24 [2018-11-18 16:19:12,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:19:12,092 INFO L480 AbstractCegarLoop]: Abstraction has 582 states and 686 transitions. [2018-11-18 16:19:12,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:19:12,092 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 686 transitions. [2018-11-18 16:19:12,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 16:19:12,093 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:19:12,093 INFO L375 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, 1, 1] [2018-11-18 16:19:12,094 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:19:12,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:12,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1128141126, now seen corresponding path program 1 times [2018-11-18 16:19:12,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:12,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:12,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:12,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:12,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:12,159 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-18 16:19:12,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:19:12,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:19:12,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:19:12,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:19:12,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:19:12,160 INFO L87 Difference]: Start difference. First operand 582 states and 686 transitions. Second operand 3 states. [2018-11-18 16:19:12,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:19:12,216 INFO L93 Difference]: Finished difference Result 1185 states and 1415 transitions. [2018-11-18 16:19:12,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:19:12,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-18 16:19:12,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:19:12,219 INFO L225 Difference]: With dead ends: 1185 [2018-11-18 16:19:12,220 INFO L226 Difference]: Without dead ends: 621 [2018-11-18 16:19:12,221 INFO L604 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-18 16:19:12,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2018-11-18 16:19:12,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2018-11-18 16:19:12,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2018-11-18 16:19:12,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 736 transitions. [2018-11-18 16:19:12,248 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 736 transitions. Word has length 48 [2018-11-18 16:19:12,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:19:12,248 INFO L480 AbstractCegarLoop]: Abstraction has 621 states and 736 transitions. [2018-11-18 16:19:12,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:19:12,249 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 736 transitions. [2018-11-18 16:19:12,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 16:19:12,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:19:12,251 INFO L375 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] [2018-11-18 16:19:12,251 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:19:12,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:12,251 INFO L82 PathProgramCache]: Analyzing trace with hash -168301447, now seen corresponding path program 1 times [2018-11-18 16:19:12,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:12,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:12,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:12,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:12,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:12,376 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-18 16:19:12,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:19:12,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:19:12,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:19:12,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:19:12,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:19:12,378 INFO L87 Difference]: Start difference. First operand 621 states and 736 transitions. Second operand 5 states. [2018-11-18 16:19:12,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:19:12,404 INFO L93 Difference]: Finished difference Result 939 states and 1117 transitions. [2018-11-18 16:19:12,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:19:12,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-11-18 16:19:12,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:19:12,407 INFO L225 Difference]: With dead ends: 939 [2018-11-18 16:19:12,408 INFO L226 Difference]: Without dead ends: 629 [2018-11-18 16:19:12,409 INFO L604 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-18 16:19:12,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-11-18 16:19:12,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2018-11-18 16:19:12,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2018-11-18 16:19:12,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 744 transitions. [2018-11-18 16:19:12,432 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 744 transitions. Word has length 83 [2018-11-18 16:19:12,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:19:12,432 INFO L480 AbstractCegarLoop]: Abstraction has 629 states and 744 transitions. [2018-11-18 16:19:12,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:19:12,433 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 744 transitions. [2018-11-18 16:19:12,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-18 16:19:12,435 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:19:12,435 INFO L375 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] [2018-11-18 16:19:12,435 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:19:12,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:12,435 INFO L82 PathProgramCache]: Analyzing trace with hash -661859837, now seen corresponding path program 1 times [2018-11-18 16:19:12,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:12,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:12,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:12,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:12,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:12,583 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-18 16:19:12,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:19:12,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:19:12,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:19:12,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:19:12,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:19:12,584 INFO L87 Difference]: Start difference. First operand 629 states and 744 transitions. Second operand 5 states. [2018-11-18 16:19:12,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:19:12,626 INFO L93 Difference]: Finished difference Result 1040 states and 1234 transitions. [2018-11-18 16:19:12,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:19:12,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-11-18 16:19:12,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:19:12,629 INFO L225 Difference]: With dead ends: 1040 [2018-11-18 16:19:12,629 INFO L226 Difference]: Without dead ends: 430 [2018-11-18 16:19:12,631 INFO L604 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-18 16:19:12,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-11-18 16:19:12,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2018-11-18 16:19:12,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-11-18 16:19:12,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 502 transitions. [2018-11-18 16:19:12,648 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 502 transitions. Word has length 89 [2018-11-18 16:19:12,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:19:12,649 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 502 transitions. [2018-11-18 16:19:12,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:19:12,649 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 502 transitions. [2018-11-18 16:19:12,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-18 16:19:12,650 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:19:12,650 INFO L375 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] [2018-11-18 16:19:12,651 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:19:12,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:12,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1555898116, now seen corresponding path program 1 times [2018-11-18 16:19:12,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:12,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:12,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:12,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:12,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:12,813 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-18 16:19:12,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:19:12,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 16:19:12,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:19:12,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:19:12,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:19:12,814 INFO L87 Difference]: Start difference. First operand 430 states and 502 transitions. Second operand 6 states. [2018-11-18 16:19:15,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:19:15,433 INFO L93 Difference]: Finished difference Result 781 states and 919 transitions. [2018-11-18 16:19:15,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 16:19:15,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-11-18 16:19:15,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:19:15,437 INFO L225 Difference]: With dead ends: 781 [2018-11-18 16:19:15,437 INFO L226 Difference]: Without dead ends: 778 [2018-11-18 16:19:15,437 INFO L604 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-18 16:19:15,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2018-11-18 16:19:15,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 748. [2018-11-18 16:19:15,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2018-11-18 16:19:15,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 887 transitions. [2018-11-18 16:19:15,473 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 887 transitions. Word has length 89 [2018-11-18 16:19:15,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:19:15,474 INFO L480 AbstractCegarLoop]: Abstraction has 748 states and 887 transitions. [2018-11-18 16:19:15,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:19:15,474 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 887 transitions. [2018-11-18 16:19:15,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-18 16:19:15,475 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:19:15,475 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:19:15,475 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:19:15,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:15,476 INFO L82 PathProgramCache]: Analyzing trace with hash 199000624, now seen corresponding path program 1 times [2018-11-18 16:19:15,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:15,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:15,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:15,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:15,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:15,558 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 16:19:15,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:19:15,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 16:19:15,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:19:15,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:19:15,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:19:15,559 INFO L87 Difference]: Start difference. First operand 748 states and 887 transitions. Second operand 6 states. [2018-11-18 16:19:17,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:19:17,631 INFO L93 Difference]: Finished difference Result 1484 states and 1775 transitions. [2018-11-18 16:19:17,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:19:17,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-11-18 16:19:17,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:19:17,635 INFO L225 Difference]: With dead ends: 1484 [2018-11-18 16:19:17,635 INFO L226 Difference]: Without dead ends: 746 [2018-11-18 16:19:17,637 INFO L604 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-18 16:19:17,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-11-18 16:19:17,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 725. [2018-11-18 16:19:17,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-11-18 16:19:17,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 871 transitions. [2018-11-18 16:19:17,670 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 871 transitions. Word has length 92 [2018-11-18 16:19:17,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:19:17,671 INFO L480 AbstractCegarLoop]: Abstraction has 725 states and 871 transitions. [2018-11-18 16:19:17,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:19:17,671 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 871 transitions. [2018-11-18 16:19:17,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 16:19:17,672 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:19:17,672 INFO L375 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] [2018-11-18 16:19:17,673 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:19:17,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:17,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1271252416, now seen corresponding path program 1 times [2018-11-18 16:19:17,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:17,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:17,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:17,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:17,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:17,760 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-18 16:19:17,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:19:17,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:19:17,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:19:17,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:19:17,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:19:17,761 INFO L87 Difference]: Start difference. First operand 725 states and 871 transitions. Second operand 5 states. [2018-11-18 16:19:17,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:19:17,791 INFO L93 Difference]: Finished difference Result 778 states and 931 transitions. [2018-11-18 16:19:17,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:19:17,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-11-18 16:19:17,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:19:17,794 INFO L225 Difference]: With dead ends: 778 [2018-11-18 16:19:17,795 INFO L226 Difference]: Without dead ends: 733 [2018-11-18 16:19:17,796 INFO L604 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-18 16:19:17,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-11-18 16:19:17,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 730. [2018-11-18 16:19:17,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-11-18 16:19:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 871 transitions. [2018-11-18 16:19:17,825 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 871 transitions. Word has length 102 [2018-11-18 16:19:17,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:19:17,826 INFO L480 AbstractCegarLoop]: Abstraction has 730 states and 871 transitions. [2018-11-18 16:19:17,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:19:17,826 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 871 transitions. [2018-11-18 16:19:17,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 16:19:17,827 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:19:17,827 INFO L375 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] [2018-11-18 16:19:17,827 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:19:17,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:17,827 INFO L82 PathProgramCache]: Analyzing trace with hash 60873477, now seen corresponding path program 1 times [2018-11-18 16:19:17,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:17,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:17,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:17,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:17,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:17,914 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-18 16:19:17,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:19:17,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:19:17,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:19:17,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:19:17,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:19:17,915 INFO L87 Difference]: Start difference. First operand 730 states and 871 transitions. Second operand 3 states. [2018-11-18 16:19:17,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:19:17,943 INFO L93 Difference]: Finished difference Result 1352 states and 1637 transitions. [2018-11-18 16:19:17,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:19:17,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-11-18 16:19:17,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:19:17,946 INFO L225 Difference]: With dead ends: 1352 [2018-11-18 16:19:17,946 INFO L226 Difference]: Without dead ends: 681 [2018-11-18 16:19:17,948 INFO L604 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-18 16:19:17,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-11-18 16:19:17,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2018-11-18 16:19:17,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2018-11-18 16:19:17,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 803 transitions. [2018-11-18 16:19:17,976 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 803 transitions. Word has length 103 [2018-11-18 16:19:17,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:19:17,976 INFO L480 AbstractCegarLoop]: Abstraction has 681 states and 803 transitions. [2018-11-18 16:19:17,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:19:17,977 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 803 transitions. [2018-11-18 16:19:17,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-18 16:19:17,977 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:19:17,977 INFO L375 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] [2018-11-18 16:19:17,978 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:19:17,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:17,978 INFO L82 PathProgramCache]: Analyzing trace with hash 841940874, now seen corresponding path program 1 times [2018-11-18 16:19:17,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:17,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:17,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:17,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:17,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:18,083 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-18 16:19:18,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:19:18,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 16:19:18,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:19:18,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:19:18,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:19:18,084 INFO L87 Difference]: Start difference. First operand 681 states and 803 transitions. Second operand 6 states. [2018-11-18 16:19:18,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:19:18,134 INFO L93 Difference]: Finished difference Result 1348 states and 1591 transitions. [2018-11-18 16:19:18,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:19:18,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-11-18 16:19:18,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:19:18,137 INFO L225 Difference]: With dead ends: 1348 [2018-11-18 16:19:18,138 INFO L226 Difference]: Without dead ends: 681 [2018-11-18 16:19:18,139 INFO L604 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-18 16:19:18,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-11-18 16:19:18,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2018-11-18 16:19:18,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2018-11-18 16:19:18,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 802 transitions. [2018-11-18 16:19:18,173 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 802 transitions. Word has length 105 [2018-11-18 16:19:18,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:19:18,173 INFO L480 AbstractCegarLoop]: Abstraction has 681 states and 802 transitions. [2018-11-18 16:19:18,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:19:18,173 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 802 transitions. [2018-11-18 16:19:18,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-18 16:19:18,174 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:19:18,174 INFO L375 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] [2018-11-18 16:19:18,175 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:19:18,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:18,175 INFO L82 PathProgramCache]: Analyzing trace with hash 813440584, now seen corresponding path program 1 times [2018-11-18 16:19:18,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:18,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:18,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:18,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:18,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:18,428 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-18 16:19:18,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:19:18,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 16:19:18,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 16:19:18,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 16:19:18,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:19:18,429 INFO L87 Difference]: Start difference. First operand 681 states and 802 transitions. Second operand 8 states. [2018-11-18 16:19:22,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:19:22,976 INFO L93 Difference]: Finished difference Result 1394 states and 1732 transitions. [2018-11-18 16:19:22,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 16:19:22,977 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2018-11-18 16:19:22,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:19:22,982 INFO L225 Difference]: With dead ends: 1394 [2018-11-18 16:19:22,982 INFO L226 Difference]: Without dead ends: 1030 [2018-11-18 16:19:22,983 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-18 16:19:22,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2018-11-18 16:19:23,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 832. [2018-11-18 16:19:23,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832 states. [2018-11-18 16:19:23,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 981 transitions. [2018-11-18 16:19:23,029 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 981 transitions. Word has length 105 [2018-11-18 16:19:23,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:19:23,029 INFO L480 AbstractCegarLoop]: Abstraction has 832 states and 981 transitions. [2018-11-18 16:19:23,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 16:19:23,029 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 981 transitions. [2018-11-18 16:19:23,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-18 16:19:23,031 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:19:23,031 INFO L375 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] [2018-11-18 16:19:23,032 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:19:23,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:23,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1616223897, now seen corresponding path program 1 times [2018-11-18 16:19:23,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:23,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:23,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:23,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:23,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:23,154 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-18 16:19:23,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:19:23,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:19:23,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:19:23,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:19:23,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:19:23,155 INFO L87 Difference]: Start difference. First operand 832 states and 981 transitions. Second operand 5 states. [2018-11-18 16:19:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:19:23,193 INFO L93 Difference]: Finished difference Result 1269 states and 1496 transitions. [2018-11-18 16:19:23,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:19:23,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2018-11-18 16:19:23,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:19:23,196 INFO L225 Difference]: With dead ends: 1269 [2018-11-18 16:19:23,197 INFO L226 Difference]: Without dead ends: 477 [2018-11-18 16:19:23,198 INFO L604 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-18 16:19:23,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-11-18 16:19:23,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2018-11-18 16:19:23,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-11-18 16:19:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 552 transitions. [2018-11-18 16:19:23,220 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 552 transitions. Word has length 119 [2018-11-18 16:19:23,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:19:23,220 INFO L480 AbstractCegarLoop]: Abstraction has 477 states and 552 transitions. [2018-11-18 16:19:23,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:19:23,220 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 552 transitions. [2018-11-18 16:19:23,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-18 16:19:23,221 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:19:23,221 INFO L375 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] [2018-11-18 16:19:23,221 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:19:23,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:23,221 INFO L82 PathProgramCache]: Analyzing trace with hash 978002920, now seen corresponding path program 1 times [2018-11-18 16:19:23,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:23,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:23,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:23,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:23,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:23,335 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-18 16:19:23,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:19:23,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 16:19:23,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:19:23,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:19:23,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:19:23,336 INFO L87 Difference]: Start difference. First operand 477 states and 552 transitions. Second operand 6 states. [2018-11-18 16:19:25,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:19:25,736 INFO L93 Difference]: Finished difference Result 773 states and 902 transitions. [2018-11-18 16:19:25,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 16:19:25,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-11-18 16:19:25,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:19:25,738 INFO L225 Difference]: With dead ends: 773 [2018-11-18 16:19:25,739 INFO L226 Difference]: Without dead ends: 768 [2018-11-18 16:19:25,739 INFO L604 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-18 16:19:25,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2018-11-18 16:19:25,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 734. [2018-11-18 16:19:25,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-11-18 16:19:25,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 863 transitions. [2018-11-18 16:19:25,760 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 863 transitions. Word has length 119 [2018-11-18 16:19:25,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:19:25,761 INFO L480 AbstractCegarLoop]: Abstraction has 734 states and 863 transitions. [2018-11-18 16:19:25,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:19:25,761 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 863 transitions. [2018-11-18 16:19:25,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-18 16:19:25,761 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:19:25,762 INFO L375 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] [2018-11-18 16:19:25,762 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:19:25,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:25,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1580421127, now seen corresponding path program 1 times [2018-11-18 16:19:25,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:25,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:25,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:25,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:25,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:25,825 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-18 16:19:25,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:19:25,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:19:25,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:19:25,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:19:25,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:19:25,826 INFO L87 Difference]: Start difference. First operand 734 states and 863 transitions. Second operand 5 states. [2018-11-18 16:19:25,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:19:25,861 INFO L93 Difference]: Finished difference Result 772 states and 903 transitions. [2018-11-18 16:19:25,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:19:25,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2018-11-18 16:19:25,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:19:25,863 INFO L225 Difference]: With dead ends: 772 [2018-11-18 16:19:25,864 INFO L226 Difference]: Without dead ends: 755 [2018-11-18 16:19:25,864 INFO L604 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-18 16:19:25,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-11-18 16:19:25,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 738. [2018-11-18 16:19:25,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2018-11-18 16:19:25,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 866 transitions. [2018-11-18 16:19:25,885 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 866 transitions. Word has length 126 [2018-11-18 16:19:25,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:19:25,885 INFO L480 AbstractCegarLoop]: Abstraction has 738 states and 866 transitions. [2018-11-18 16:19:25,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:19:25,885 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 866 transitions. [2018-11-18 16:19:25,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-18 16:19:25,886 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:19:25,886 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 16:19:25,886 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:19:25,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:25,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1008911852, now seen corresponding path program 1 times [2018-11-18 16:19:25,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:25,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:25,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:25,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:25,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:25,989 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 16:19:25,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:19:25,989 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88932ab3-79aa-4282-85da-30258cb257a0/bin-2019/uautomizer/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-18 16:19:26,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:26,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:19:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 16:19:26,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:19:26,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-11-18 16:19:26,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:19:26,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:19:26,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:19:26,228 INFO L87 Difference]: Start difference. First operand 738 states and 866 transitions. Second operand 5 states. [2018-11-18 16:19:26,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:19:26,279 INFO L93 Difference]: Finished difference Result 1277 states and 1498 transitions. [2018-11-18 16:19:26,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:19:26,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2018-11-18 16:19:26,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:19:26,282 INFO L225 Difference]: With dead ends: 1277 [2018-11-18 16:19:26,282 INFO L226 Difference]: Without dead ends: 608 [2018-11-18 16:19:26,283 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 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-18 16:19:26,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-11-18 16:19:26,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 602. [2018-11-18 16:19:26,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-11-18 16:19:26,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 692 transitions. [2018-11-18 16:19:26,306 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 692 transitions. Word has length 131 [2018-11-18 16:19:26,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:19:26,307 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 692 transitions. [2018-11-18 16:19:26,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:19:26,307 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 692 transitions. [2018-11-18 16:19:26,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-18 16:19:26,308 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:19:26,308 INFO L375 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] [2018-11-18 16:19:26,309 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:19:26,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:26,309 INFO L82 PathProgramCache]: Analyzing trace with hash -804380245, now seen corresponding path program 1 times [2018-11-18 16:19:26,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:26,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:26,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:26,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:26,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:26,396 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-18 16:19:26,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:19:26,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:19:26,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:19:26,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:19:26,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:19:26,397 INFO L87 Difference]: Start difference. First operand 602 states and 692 transitions. Second operand 3 states. [2018-11-18 16:19:26,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:19:26,419 INFO L93 Difference]: Finished difference Result 798 states and 915 transitions. [2018-11-18 16:19:26,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:19:26,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2018-11-18 16:19:26,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:19:26,421 INFO L225 Difference]: With dead ends: 798 [2018-11-18 16:19:26,421 INFO L226 Difference]: Without dead ends: 382 [2018-11-18 16:19:26,422 INFO L604 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-18 16:19:26,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-18 16:19:26,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-18 16:19:26,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-18 16:19:26,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 428 transitions. [2018-11-18 16:19:26,438 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 428 transitions. Word has length 144 [2018-11-18 16:19:26,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:19:26,438 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 428 transitions. [2018-11-18 16:19:26,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:19:26,438 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 428 transitions. [2018-11-18 16:19:26,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-18 16:19:26,439 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:19:26,440 INFO L375 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] [2018-11-18 16:19:26,440 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:19:26,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:26,440 INFO L82 PathProgramCache]: Analyzing trace with hash 678448358, now seen corresponding path program 1 times [2018-11-18 16:19:26,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:26,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:26,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:26,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:26,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:26,654 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-18 16:19:26,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:19:26,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 16:19:26,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 16:19:26,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 16:19:26,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:19:26,655 INFO L87 Difference]: Start difference. First operand 382 states and 428 transitions. Second operand 8 states. [2018-11-18 16:19:30,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:19:30,808 INFO L93 Difference]: Finished difference Result 435 states and 495 transitions. [2018-11-18 16:19:30,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 16:19:30,808 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 146 [2018-11-18 16:19:30,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:19:30,810 INFO L225 Difference]: With dead ends: 435 [2018-11-18 16:19:30,810 INFO L226 Difference]: Without dead ends: 414 [2018-11-18 16:19:30,811 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-18 16:19:30,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-11-18 16:19:30,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 365. [2018-11-18 16:19:30,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-11-18 16:19:30,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 409 transitions. [2018-11-18 16:19:30,832 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 409 transitions. Word has length 146 [2018-11-18 16:19:30,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:19:30,832 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 409 transitions. [2018-11-18 16:19:30,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 16:19:30,833 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 409 transitions. [2018-11-18 16:19:30,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-18 16:19:30,834 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:19:30,834 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:19:30,834 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:19:30,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:30,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1736874250, now seen corresponding path program 1 times [2018-11-18 16:19:30,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:30,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:30,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:30,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:30,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:31,044 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 16:19:31,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:19:31,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 16:19:31,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:19:31,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:19:31,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:19:31,047 INFO L87 Difference]: Start difference. First operand 365 states and 409 transitions. Second operand 6 states. [2018-11-18 16:19:33,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:19:33,099 INFO L93 Difference]: Finished difference Result 555 states and 622 transitions. [2018-11-18 16:19:33,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:19:33,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2018-11-18 16:19:33,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:19:33,102 INFO L225 Difference]: With dead ends: 555 [2018-11-18 16:19:33,103 INFO L226 Difference]: Without dead ends: 340 [2018-11-18 16:19:33,103 INFO L604 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-18 16:19:33,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-18 16:19:33,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 321. [2018-11-18 16:19:33,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-11-18 16:19:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 355 transitions. [2018-11-18 16:19:33,124 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 355 transitions. Word has length 167 [2018-11-18 16:19:33,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:19:33,124 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 355 transitions. [2018-11-18 16:19:33,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:19:33,125 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 355 transitions. [2018-11-18 16:19:33,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-18 16:19:33,126 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:19:33,127 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-18 16:19:33,127 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:19:33,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:33,127 INFO L82 PathProgramCache]: Analyzing trace with hash 2052074876, now seen corresponding path program 1 times [2018-11-18 16:19:33,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:33,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:33,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:33,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:33,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:33,373 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 16:19:33,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:19:33,374 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88932ab3-79aa-4282-85da-30258cb257a0/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:19:33,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:33,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:19:33,614 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 16:19:33,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:19:33,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2018-11-18 16:19:33,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 16:19:33,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 16:19:33,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-18 16:19:33,632 INFO L87 Difference]: Start difference. First operand 321 states and 355 transitions. Second operand 15 states. [2018-11-18 16:19:38,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:19:38,478 INFO L93 Difference]: Finished difference Result 329 states and 363 transitions. [2018-11-18 16:19:38,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 16:19:38,479 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 176 [2018-11-18 16:19:38,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:19:38,480 INFO L225 Difference]: With dead ends: 329 [2018-11-18 16:19:38,480 INFO L226 Difference]: Without dead ends: 325 [2018-11-18 16:19:38,481 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 175 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-11-18 16:19:38,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-11-18 16:19:38,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 319. [2018-11-18 16:19:38,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-11-18 16:19:38,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 351 transitions. [2018-11-18 16:19:38,493 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 351 transitions. Word has length 176 [2018-11-18 16:19:38,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:19:38,493 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 351 transitions. [2018-11-18 16:19:38,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 16:19:38,493 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 351 transitions. [2018-11-18 16:19:38,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-18 16:19:38,495 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:19:38,495 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-18 16:19:38,495 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:19:38,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:38,496 INFO L82 PathProgramCache]: Analyzing trace with hash -810332342, now seen corresponding path program 1 times [2018-11-18 16:19:38,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:38,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:38,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:38,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:38,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:38,670 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 16:19:38,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:19:38,670 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88932ab3-79aa-4282-85da-30258cb257a0/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:19:38,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:38,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:19:38,921 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 16:19:38,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:19:38,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2018-11-18 16:19:38,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 16:19:38,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 16:19:38,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-11-18 16:19:38,939 INFO L87 Difference]: Start difference. First operand 319 states and 351 transitions. Second operand 14 states. [2018-11-18 16:19:49,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:19:49,272 INFO L93 Difference]: Finished difference Result 322 states and 354 transitions. [2018-11-18 16:19:49,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 16:19:49,273 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 177 [2018-11-18 16:19:49,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:19:49,273 INFO L225 Difference]: With dead ends: 322 [2018-11-18 16:19:49,273 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 16:19:49,274 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 177 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-11-18 16:19:49,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 16:19:49,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 16:19:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 16:19:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 16:19:49,275 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 177 [2018-11-18 16:19:49,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:19:49,275 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:19:49,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 16:19:49,275 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 16:19:49,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 16:19:49,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 16:19:49,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:19:49,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:19:49,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:19:49,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:19:49,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:19:49,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:19:50,865 INFO L425 ceAbstractionStarter]: For program point L3489(lines 3489 3493) no Hoare annotation was computed. [2018-11-18 16:19:50,865 INFO L425 ceAbstractionStarter]: For program point L3486(lines 3486 3493) no Hoare annotation was computed. [2018-11-18 16:19:50,865 INFO L425 ceAbstractionStarter]: For program point L3489-2(lines 3486 3493) no Hoare annotation was computed. [2018-11-18 16:19:50,865 INFO L425 ceAbstractionStarter]: For program point usb_fill_int_urbFINAL(lines 3473 3497) no Hoare annotation was computed. [2018-11-18 16:19:50,865 INFO L425 ceAbstractionStarter]: For program point usb_fill_int_urbEXIT(lines 3473 3497) no Hoare annotation was computed. [2018-11-18 16:19:50,865 INFO L428 ceAbstractionStarter]: At program point usb_fill_int_urbENTRY(lines 3473 3497) the Hoare annotation is: true [2018-11-18 16:19:50,865 INFO L428 ceAbstractionStarter]: At program point kbtab_initENTRY(lines 3928 3946) the Hoare annotation is: true [2018-11-18 16:19:50,865 INFO L425 ceAbstractionStarter]: For program point L3935(lines 3935 3939) no Hoare annotation was computed. [2018-11-18 16:19:50,865 INFO L425 ceAbstractionStarter]: For program point L3933-1(line 3933) no Hoare annotation was computed. [2018-11-18 16:19:50,865 INFO L428 ceAbstractionStarter]: At program point L3933(line 3933) the Hoare annotation is: true [2018-11-18 16:19:50,865 INFO L425 ceAbstractionStarter]: For program point kbtab_initFINAL(lines 3928 3946) no Hoare annotation was computed. [2018-11-18 16:19:50,865 INFO L428 ceAbstractionStarter]: At program point L3943(lines 3931 3945) the Hoare annotation is: true [2018-11-18 16:19:50,866 INFO L425 ceAbstractionStarter]: For program point kbtab_initEXIT(lines 3928 3946) no Hoare annotation was computed. [2018-11-18 16:19:50,866 INFO L425 ceAbstractionStarter]: For program point input_get_drvdataEXIT(lines 3517 3526) no Hoare annotation was computed. [2018-11-18 16:19:50,866 INFO L425 ceAbstractionStarter]: For program point input_get_drvdataENTRY(lines 3517 3526) no Hoare annotation was computed. [2018-11-18 16:19:50,866 INFO L425 ceAbstractionStarter]: For program point input_get_drvdataFINAL(lines 3517 3526) no Hoare annotation was computed. [2018-11-18 16:19:50,866 INFO L421 ceAbstractionStarter]: At program point L3904(line 3904) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0)) (< 1 |old(~ldv_coherent_state~0)|) (< 1 |old(~ldv_urb_state~0)|) (< |old(~ldv_coherent_state~0)| 1) (not (= ~res_kbtab_probe_3~0 0)) (< |old(~ldv_urb_state~0)| 1)) [2018-11-18 16:19:50,866 INFO L425 ceAbstractionStarter]: For program point kbtab_disconnectFINAL(lines 3893 3909) no Hoare annotation was computed. [2018-11-18 16:19:50,866 INFO L425 ceAbstractionStarter]: For program point L3903-1(line 3903) no Hoare annotation was computed. [2018-11-18 16:19:50,866 INFO L421 ceAbstractionStarter]: At program point L3903(line 3903) the Hoare annotation is: (or (< 1 |old(~ldv_coherent_state~0)|) (< 1 |old(~ldv_urb_state~0)|) (< |old(~ldv_coherent_state~0)| 1) (not (= ~res_kbtab_probe_3~0 0)) (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= 1 ~ldv_urb_state~0)) (< |old(~ldv_urb_state~0)| 1)) [2018-11-18 16:19:50,866 INFO L425 ceAbstractionStarter]: For program point L3904-1(line 3904) no Hoare annotation was computed. [2018-11-18 16:19:50,866 INFO L425 ceAbstractionStarter]: For program point L3901-1(line 3901) no Hoare annotation was computed. [2018-11-18 16:19:50,866 INFO L421 ceAbstractionStarter]: At program point L3901(line 3901) the Hoare annotation is: (or (< 1 |old(~ldv_coherent_state~0)|) (< 1 |old(~ldv_urb_state~0)|) (< |old(~ldv_coherent_state~0)| 1) (not (= ~res_kbtab_probe_3~0 0)) (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= 1 ~ldv_urb_state~0)) (< |old(~ldv_urb_state~0)| 1)) [2018-11-18 16:19:50,866 INFO L425 ceAbstractionStarter]: For program point L3899-1(line 3899) no Hoare annotation was computed. [2018-11-18 16:19:50,866 INFO L421 ceAbstractionStarter]: At program point L3899(line 3899) the Hoare annotation is: (or (< 1 |old(~ldv_coherent_state~0)|) (< 1 |old(~ldv_urb_state~0)|) (< |old(~ldv_coherent_state~0)| 1) (not (= ~res_kbtab_probe_3~0 0)) (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= 1 ~ldv_urb_state~0)) (< |old(~ldv_urb_state~0)| 1)) [2018-11-18 16:19:50,867 INFO L421 ceAbstractionStarter]: At program point kbtab_disconnectENTRY(lines 3893 3909) the Hoare annotation is: (or (< 1 |old(~ldv_coherent_state~0)|) (< 1 |old(~ldv_urb_state~0)|) (< |old(~ldv_coherent_state~0)| 1) (not (= ~res_kbtab_probe_3~0 0)) (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= 1 ~ldv_urb_state~0)) (< |old(~ldv_urb_state~0)| 1)) [2018-11-18 16:19:50,867 INFO L425 ceAbstractionStarter]: For program point kbtab_disconnectEXIT(lines 3893 3909) no Hoare annotation was computed. [2018-11-18 16:19:50,867 INFO L425 ceAbstractionStarter]: For program point __le16_to_cpupFINAL(lines 3374 3380) no Hoare annotation was computed. [2018-11-18 16:19:50,867 INFO L425 ceAbstractionStarter]: For program point __le16_to_cpupEXIT(lines 3374 3380) no Hoare annotation was computed. [2018-11-18 16:19:50,867 INFO L425 ceAbstractionStarter]: For program point __le16_to_cpupENTRY(lines 3374 3380) no Hoare annotation was computed. [2018-11-18 16:19:50,867 INFO L425 ceAbstractionStarter]: For program point L3999(lines 3999 4003) no Hoare annotation was computed. [2018-11-18 16:19:50,867 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 3985 4076) no Hoare annotation was computed. [2018-11-18 16:19:50,867 INFO L425 ceAbstractionStarter]: For program point L4049-1(line 4049) no Hoare annotation was computed. [2018-11-18 16:19:50,867 INFO L421 ceAbstractionStarter]: At program point L4049(line 4049) the Hoare annotation is: (or (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (<= 1 ~ldv_coherent_state~0) (<= 1 main_~ldv_s_kbtab_driver_usb_driver~0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-18 16:19:50,867 INFO L425 ceAbstractionStarter]: For program point L4033-1(line 4033) no Hoare annotation was computed. [2018-11-18 16:19:50,867 INFO L421 ceAbstractionStarter]: At program point L4033(line 4033) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (= 0 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= main_~ldv_s_kbtab_driver_usb_driver~0 0)) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-18 16:19:50,867 INFO L425 ceAbstractionStarter]: For program point L4025(lines 4025 4061) no Hoare annotation was computed. [2018-11-18 16:19:50,867 INFO L421 ceAbstractionStarter]: At program point L4063(lines 4005 4064) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (= 0 ~ldv_coherent_state~0)) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-18 16:19:50,867 INFO L425 ceAbstractionStarter]: For program point L3997-1(line 3997) no Hoare annotation was computed. [2018-11-18 16:19:50,867 INFO L421 ceAbstractionStarter]: At program point L3997(line 3997) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (= 0 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0)) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-18 16:19:50,868 INFO L421 ceAbstractionStarter]: At program point L4026(lines 4025 4061) the Hoare annotation is: (let ((.cse0 (= 0 ~res_kbtab_probe_3~0))) (or (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (= 0 ~ldv_coherent_state~0) .cse0 (= main_~ldv_s_kbtab_driver_usb_driver~0 0) (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1)))) (and (<= 1 ~ldv_coherent_state~0) (<= 1 main_~ldv_s_kbtab_driver_usb_driver~0) .cse0 (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= 0 |old(~ldv_coherent_state~0)|)))) [2018-11-18 16:19:50,868 INFO L421 ceAbstractionStarter]: At program point L4059(lines 4006 4062) the Hoare annotation is: (let ((.cse0 (= 0 ~res_kbtab_probe_3~0))) (or (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (= 0 ~ldv_coherent_state~0) .cse0 (= main_~ldv_s_kbtab_driver_usb_driver~0 0) (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1)))) (and (<= 1 ~ldv_coherent_state~0) (<= 1 main_~ldv_s_kbtab_driver_usb_driver~0) .cse0 (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= 0 |old(~ldv_coherent_state~0)|)))) [2018-11-18 16:19:50,868 INFO L425 ceAbstractionStarter]: For program point L4022(lines 4022 4061) no Hoare annotation was computed. [2018-11-18 16:19:50,868 INFO L425 ceAbstractionStarter]: For program point $Ultimate##18(lines 4029 4060) no Hoare annotation was computed. [2018-11-18 16:19:50,868 INFO L425 ceAbstractionStarter]: For program point L4014(lines 4014 4018) no Hoare annotation was computed. [2018-11-18 16:19:50,868 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 3985 4076) no Hoare annotation was computed. [2018-11-18 16:19:50,868 INFO L425 ceAbstractionStarter]: For program point L4014-1(lines 4011 4018) no Hoare annotation was computed. [2018-11-18 16:19:50,868 INFO L425 ceAbstractionStarter]: For program point $Ultimate##19(lines 4029 4060) no Hoare annotation was computed. [2018-11-18 16:19:50,868 INFO L425 ceAbstractionStarter]: For program point L4072(line 4072) no Hoare annotation was computed. [2018-11-18 16:19:50,868 INFO L421 ceAbstractionStarter]: At program point L4068(lines 3993 4075) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (= 0 ~ldv_coherent_state~0)) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-18 16:19:50,868 INFO L425 ceAbstractionStarter]: For program point L4006-1(lines 4006 4062) no Hoare annotation was computed. [2018-11-18 16:19:50,869 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 3985 4076) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (= 0 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0)) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-18 16:19:50,869 INFO L421 ceAbstractionStarter]: At program point L4023(lines 4022 4061) the Hoare annotation is: (let ((.cse0 (= 0 ~res_kbtab_probe_3~0))) (or (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (= 0 ~ldv_coherent_state~0) .cse0 (= main_~ldv_s_kbtab_driver_usb_driver~0 0) (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1)))) (and (<= 1 ~ldv_coherent_state~0) (<= 1 main_~ldv_s_kbtab_driver_usb_driver~0) .cse0 (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= 0 |old(~ldv_coherent_state~0)|)))) [2018-11-18 16:19:50,869 INFO L425 ceAbstractionStarter]: For program point L4011(lines 4011 4018) no Hoare annotation was computed. [2018-11-18 16:19:50,869 INFO L425 ceAbstractionStarter]: For program point L4007(line 4007) no Hoare annotation was computed. [2018-11-18 16:19:50,869 INFO L425 ceAbstractionStarter]: For program point L4036(lines 4036 4040) no Hoare annotation was computed. [2018-11-18 16:19:50,869 INFO L425 ceAbstractionStarter]: For program point L3964(line 3964) no Hoare annotation was computed. [2018-11-18 16:19:50,869 INFO L425 ceAbstractionStarter]: For program point init_moduleFINAL(lines 3959 3968) no Hoare annotation was computed. [2018-11-18 16:19:50,869 INFO L425 ceAbstractionStarter]: For program point init_moduleENTRY(lines 3959 3968) no Hoare annotation was computed. [2018-11-18 16:19:50,869 INFO L425 ceAbstractionStarter]: For program point L3964-1(line 3964) no Hoare annotation was computed. [2018-11-18 16:19:50,869 INFO L425 ceAbstractionStarter]: For program point init_moduleEXIT(lines 3959 3968) no Hoare annotation was computed. [2018-11-18 16:19:50,869 INFO L425 ceAbstractionStarter]: For program point usb_get_intfdataEXIT(lines 3415 3424) no Hoare annotation was computed. [2018-11-18 16:19:50,869 INFO L428 ceAbstractionStarter]: At program point usb_get_intfdataENTRY(lines 3415 3424) the Hoare annotation is: true [2018-11-18 16:19:50,870 INFO L425 ceAbstractionStarter]: For program point usb_get_intfdataFINAL(lines 3415 3424) no Hoare annotation was computed. [2018-11-18 16:19:50,870 INFO L425 ceAbstractionStarter]: For program point kbtab_exitFINAL(lines 3949 3958) no Hoare annotation was computed. [2018-11-18 16:19:50,870 INFO L428 ceAbstractionStarter]: At program point kbtab_exitENTRY(lines 3949 3958) the Hoare annotation is: true [2018-11-18 16:19:50,870 INFO L425 ceAbstractionStarter]: For program point kbtab_exitEXIT(lines 3949 3958) no Hoare annotation was computed. [2018-11-18 16:19:50,870 INFO L428 ceAbstractionStarter]: At program point usb_to_input_idENTRY(lines 3575 3585) the Hoare annotation is: true [2018-11-18 16:19:50,870 INFO L425 ceAbstractionStarter]: For program point usb_to_input_idFINAL(lines 3575 3585) no Hoare annotation was computed. [2018-11-18 16:19:50,870 INFO L425 ceAbstractionStarter]: For program point usb_to_input_idEXIT(lines 3575 3585) no Hoare annotation was computed. [2018-11-18 16:19:50,870 INFO L428 ceAbstractionStarter]: At program point L3402(line 3402) the Hoare annotation is: true [2018-11-18 16:19:50,870 INFO L425 ceAbstractionStarter]: For program point kzallocEXIT(lines 3397 3406) no Hoare annotation was computed. [2018-11-18 16:19:50,870 INFO L425 ceAbstractionStarter]: For program point L3402-1(line 3402) no Hoare annotation was computed. [2018-11-18 16:19:50,870 INFO L428 ceAbstractionStarter]: At program point kzallocENTRY(lines 3397 3406) the Hoare annotation is: true [2018-11-18 16:19:50,870 INFO L425 ceAbstractionStarter]: For program point kzallocFINAL(lines 3397 3406) no Hoare annotation was computed. [2018-11-18 16:19:50,870 INFO L425 ceAbstractionStarter]: For program point input_syncENTRY(lines 3563 3572) no Hoare annotation was computed. [2018-11-18 16:19:50,870 INFO L425 ceAbstractionStarter]: For program point input_syncFINAL(lines 3563 3572) no Hoare annotation was computed. [2018-11-18 16:19:50,871 INFO L425 ceAbstractionStarter]: For program point input_syncEXIT(lines 3563 3572) no Hoare annotation was computed. [2018-11-18 16:19:50,871 INFO L428 ceAbstractionStarter]: At program point kmallocENTRY(lines 3386 3396) the Hoare annotation is: true [2018-11-18 16:19:50,871 INFO L425 ceAbstractionStarter]: For program point kmallocFINAL(lines 3386 3396) no Hoare annotation was computed. [2018-11-18 16:19:50,871 INFO L425 ceAbstractionStarter]: For program point kmallocEXIT(lines 3386 3396) no Hoare annotation was computed. [2018-11-18 16:19:50,871 INFO L425 ceAbstractionStarter]: For program point ldv_assume_stopFINAL(lines 4087 4094) no Hoare annotation was computed. [2018-11-18 16:19:50,871 INFO L428 ceAbstractionStarter]: At program point ldv_assume_stopENTRY(lines 4087 4094) the Hoare annotation is: true [2018-11-18 16:19:50,871 INFO L425 ceAbstractionStarter]: For program point ldv_assume_stopEXIT(lines 4087 4094) no Hoare annotation was computed. [2018-11-18 16:19:50,871 INFO L425 ceAbstractionStarter]: For program point kbtab_openENTRY(lines 3762 3781) no Hoare annotation was computed. [2018-11-18 16:19:50,871 INFO L425 ceAbstractionStarter]: For program point L3774(lines 3774 3778) no Hoare annotation was computed. [2018-11-18 16:19:50,871 INFO L425 ceAbstractionStarter]: For program point L3769-1(line 3769) no Hoare annotation was computed. [2018-11-18 16:19:50,871 INFO L425 ceAbstractionStarter]: For program point kbtab_openFINAL(lines 3762 3781) no Hoare annotation was computed. [2018-11-18 16:19:50,871 INFO L425 ceAbstractionStarter]: For program point L3769(line 3769) no Hoare annotation was computed. [2018-11-18 16:19:50,871 INFO L425 ceAbstractionStarter]: For program point kbtab_openEXIT(lines 3762 3781) no Hoare annotation was computed. [2018-11-18 16:19:50,872 INFO L421 ceAbstractionStarter]: At program point L4156(lines 4128 4161) the Hoare annotation is: (let ((.cse0 (let ((.cse2 (+ ~ldv_coherent_state~0 1))) (and (<= .cse2 |old(~ldv_coherent_state~0)|) (< 0 .cse2) (let ((.cse4 (+ usb_free_coherent_~addr.base usb_free_coherent_~addr.offset))) (let ((.cse3 (div .cse4 18446744073709551616))) (or (< (* 18446744073709551616 .cse3) .cse4) (<= (+ .cse3 1) 0))))))) (.cse1 (< |old(~ldv_coherent_state~0)| 1))) (and (or .cse0 .cse1 (not (= ~res_kbtab_probe_3~0 0))) (or .cse0 .cse1 (not (= 0 ~ldv_urb_state~0))))) [2018-11-18 16:19:50,872 INFO L421 ceAbstractionStarter]: At program point usb_free_coherentENTRY(lines 4128 4161) the Hoare annotation is: (let ((.cse1 (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0)) (.cse0 (< |old(~ldv_coherent_state~0)| 1))) (and (or .cse0 (not (= ~res_kbtab_probe_3~0 0)) .cse1) (or .cse1 .cse0 (not (= 0 ~ldv_urb_state~0))))) [2018-11-18 16:19:50,872 INFO L425 ceAbstractionStarter]: For program point L4134(lines 4133 4155) no Hoare annotation was computed. [2018-11-18 16:19:50,872 INFO L425 ceAbstractionStarter]: For program point usb_free_coherentEXIT(lines 4128 4161) no Hoare annotation was computed. [2018-11-18 16:19:50,872 INFO L425 ceAbstractionStarter]: For program point L4147-1(lines 4143 4149) no Hoare annotation was computed. [2018-11-18 16:19:50,872 INFO L421 ceAbstractionStarter]: At program point L4147(line 4147) the Hoare annotation is: (let ((.cse0 (< |old(~ldv_coherent_state~0)| 1))) (and (or .cse0 (not (= ~res_kbtab_probe_3~0 0))) (or .cse0 (not (= 0 ~ldv_urb_state~0))))) [2018-11-18 16:19:50,872 INFO L425 ceAbstractionStarter]: For program point L4143(lines 4143 4149) no Hoare annotation was computed. [2018-11-18 16:19:50,872 INFO L428 ceAbstractionStarter]: At program point L4137(line 4137) the Hoare annotation is: true [2018-11-18 16:19:50,872 INFO L425 ceAbstractionStarter]: For program point L4135(lines 4133 4155) no Hoare annotation was computed. [2018-11-18 16:19:50,872 INFO L425 ceAbstractionStarter]: For program point L4133-1(lines 4133 4155) no Hoare annotation was computed. [2018-11-18 16:19:50,872 INFO L421 ceAbstractionStarter]: At program point L4133loopEntry(lines 4133 4155) the Hoare annotation is: (let ((.cse1 (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0)) (.cse0 (< |old(~ldv_coherent_state~0)| 1))) (and (or .cse0 (not (= ~res_kbtab_probe_3~0 0)) .cse1) (or .cse1 .cse0 (not (= 0 ~ldv_urb_state~0))))) [2018-11-18 16:19:50,873 INFO L425 ceAbstractionStarter]: For program point usb_alloc_coherentFINAL(lines 4099 4126) no Hoare annotation was computed. [2018-11-18 16:19:50,873 INFO L421 ceAbstractionStarter]: At program point usb_alloc_coherentENTRY(lines 4099 4126) the Hoare annotation is: (or (= 0 ~ldv_coherent_state~0) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 ~ldv_urb_state~0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-18 16:19:50,873 INFO L425 ceAbstractionStarter]: For program point L4121(lines 4105 4122) no Hoare annotation was computed. [2018-11-18 16:19:50,873 INFO L425 ceAbstractionStarter]: For program point usb_alloc_coherentEXIT(lines 4099 4126) no Hoare annotation was computed. [2018-11-18 16:19:50,873 INFO L425 ceAbstractionStarter]: For program point L4112(lines 4112 4116) no Hoare annotation was computed. [2018-11-18 16:19:50,873 INFO L421 ceAbstractionStarter]: At program point L4106loopEntry(lines 4106 4120) the Hoare annotation is: (or (= 0 ~ldv_coherent_state~0) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 ~ldv_urb_state~0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-18 16:19:50,873 INFO L425 ceAbstractionStarter]: For program point L4107(line 4107) no Hoare annotation was computed. [2018-11-18 16:19:50,873 INFO L425 ceAbstractionStarter]: For program point L4106-1(lines 4106 4120) no Hoare annotation was computed. [2018-11-18 16:19:50,873 INFO L428 ceAbstractionStarter]: At program point usb_set_intfdataENTRY(lines 3427 3436) the Hoare annotation is: true [2018-11-18 16:19:50,873 INFO L425 ceAbstractionStarter]: For program point usb_set_intfdataFINAL(lines 3427 3436) no Hoare annotation was computed. [2018-11-18 16:19:50,873 INFO L425 ceAbstractionStarter]: For program point usb_set_intfdataEXIT(lines 3427 3436) no Hoare annotation was computed. [2018-11-18 16:19:50,873 INFO L425 ceAbstractionStarter]: For program point L3809-1(line 3809) no Hoare annotation was computed. [2018-11-18 16:19:50,874 INFO L421 ceAbstractionStarter]: At program point L3809(line 3809) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (= 0 ~ldv_coherent_state~0)) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-18 16:19:50,874 INFO L421 ceAbstractionStarter]: At program point L3834(line 3834) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-18 16:19:50,874 INFO L425 ceAbstractionStarter]: For program point L3834-1(line 3834) no Hoare annotation was computed. [2018-11-18 16:19:50,874 INFO L421 ceAbstractionStarter]: At program point L3814(line 3814) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 0)) (and (= 0 ~ldv_urb_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (= 0 ~ldv_coherent_state~0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-18 16:19:50,874 INFO L425 ceAbstractionStarter]: For program point L3814-1(line 3814) no Hoare annotation was computed. [2018-11-18 16:19:50,874 INFO L425 ceAbstractionStarter]: For program point L3868(lines 3868 3872) no Hoare annotation was computed. [2018-11-18 16:19:50,874 INFO L421 ceAbstractionStarter]: At program point L3860(line 3860) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|)) (and (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1)))) [2018-11-18 16:19:50,874 INFO L425 ceAbstractionStarter]: For program point L3860-1(line 3860) no Hoare annotation was computed. [2018-11-18 16:19:50,874 INFO L421 ceAbstractionStarter]: At program point L3885(lines 3807 3891) the Hoare annotation is: (or (and (or (<= (+ kbtab_probe_~error~0 1) 0) (< 0 kbtab_probe_~error~0)) (and (< 0 (+ ~ldv_coherent_state~0 1)) (<= ~ldv_coherent_state~0 0)) (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1)))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-18 16:19:50,874 INFO L425 ceAbstractionStarter]: For program point L3819(lines 3819 3823) no Hoare annotation was computed. [2018-11-18 16:19:50,874 INFO L421 ceAbstractionStarter]: At program point L3848(line 3848) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|)) (and (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1)))) [2018-11-18 16:19:50,875 INFO L421 ceAbstractionStarter]: At program point L3881(lines 3807 3891) the Hoare annotation is: (or (and (and (or (<= (+ kbtab_probe_~error~0 1) 0) (< 0 kbtab_probe_~error~0)) (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1)))) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-18 16:19:50,875 INFO L425 ceAbstractionStarter]: For program point L3848-1(line 3848) no Hoare annotation was computed. [2018-11-18 16:19:50,875 INFO L421 ceAbstractionStarter]: At program point L3844(line 3844) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|)) (and (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1)))) [2018-11-18 16:19:50,875 INFO L425 ceAbstractionStarter]: For program point L3844-1(line 3844) no Hoare annotation was computed. [2018-11-18 16:19:50,875 INFO L425 ceAbstractionStarter]: For program point L3836(lines 3836 3840) no Hoare annotation was computed. [2018-11-18 16:19:50,875 INFO L421 ceAbstractionStarter]: At program point L3869(lines 3807 3891) the Hoare annotation is: (or (and (or (<= (+ kbtab_probe_~error~0 1) 0) (< 0 kbtab_probe_~error~0)) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (<= 1 ~ldv_urb_state~0)) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-18 16:19:50,875 INFO L421 ceAbstractionStarter]: At program point kbtab_probeENTRY(lines 3795 3892) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (= 0 ~ldv_coherent_state~0)) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-18 16:19:50,875 INFO L425 ceAbstractionStarter]: For program point L3828(lines 3828 3832) no Hoare annotation was computed. [2018-11-18 16:19:50,875 INFO L425 ceAbstractionStarter]: For program point L3861-1(lines 3861 3862) no Hoare annotation was computed. [2018-11-18 16:19:50,876 INFO L421 ceAbstractionStarter]: At program point L3861(lines 3861 3862) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|)) (and (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1)))) [2018-11-18 16:19:50,876 INFO L425 ceAbstractionStarter]: For program point kbtab_probeFINAL(lines 3795 3892) no Hoare annotation was computed. [2018-11-18 16:19:50,876 INFO L425 ceAbstractionStarter]: For program point L3816(lines 3816 3823) no Hoare annotation was computed. [2018-11-18 16:19:50,876 INFO L421 ceAbstractionStarter]: At program point L3812(line 3812) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 0)) (and (= 0 ~ldv_urb_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (= 0 ~ldv_coherent_state~0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-18 16:19:50,876 INFO L421 ceAbstractionStarter]: At program point L3874(line 3874) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-18 16:19:50,876 INFO L425 ceAbstractionStarter]: For program point L3812-1(line 3812) no Hoare annotation was computed. [2018-11-18 16:19:50,876 INFO L425 ceAbstractionStarter]: For program point L3874-1(line 3874) no Hoare annotation was computed. [2018-11-18 16:19:50,876 INFO L425 ceAbstractionStarter]: For program point kbtab_probeEXIT(lines 3795 3892) no Hoare annotation was computed. [2018-11-18 16:19:50,876 INFO L425 ceAbstractionStarter]: For program point L3825-1(line 3825) no Hoare annotation was computed. [2018-11-18 16:19:50,876 INFO L421 ceAbstractionStarter]: At program point L3825(line 3825) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 0)) (and (= 0 ~ldv_urb_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (= 0 ~ldv_coherent_state~0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-18 16:19:50,876 INFO L421 ceAbstractionStarter]: At program point L3850(line 3850) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|)) (and (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1)))) [2018-11-18 16:19:50,876 INFO L425 ceAbstractionStarter]: For program point L3883-1(line 3883) no Hoare annotation was computed. [2018-11-18 16:19:50,877 INFO L421 ceAbstractionStarter]: At program point L3883(line 3883) the Hoare annotation is: (or (and (and (or (<= (+ kbtab_probe_~error~0 1) 0) (< 0 kbtab_probe_~error~0)) (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1)))) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-18 16:19:50,877 INFO L425 ceAbstractionStarter]: For program point L3850-1(line 3850) no Hoare annotation was computed. [2018-11-18 16:19:50,877 INFO L425 ceAbstractionStarter]: For program point L3879-1(line 3879) no Hoare annotation was computed. [2018-11-18 16:19:50,877 INFO L421 ceAbstractionStarter]: At program point L3879(line 3879) the Hoare annotation is: (or (and (or (<= (+ kbtab_probe_~error~0 1) 0) (< 0 kbtab_probe_~error~0)) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (<= 1 ~ldv_urb_state~0)) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-18 16:19:50,877 INFO L428 ceAbstractionStarter]: At program point input_set_drvdataENTRY(lines 3527 3536) the Hoare annotation is: true [2018-11-18 16:19:50,877 INFO L425 ceAbstractionStarter]: For program point input_set_drvdataFINAL(lines 3527 3536) no Hoare annotation was computed. [2018-11-18 16:19:50,877 INFO L425 ceAbstractionStarter]: For program point input_set_drvdataEXIT(lines 3527 3536) no Hoare annotation was computed. [2018-11-18 16:19:50,877 INFO L425 ceAbstractionStarter]: For program point usb_make_pathEXIT(lines 3445 3460) no Hoare annotation was computed. [2018-11-18 16:19:50,877 INFO L425 ceAbstractionStarter]: For program point L3453(lines 3453 3457) no Hoare annotation was computed. [2018-11-18 16:19:50,877 INFO L425 ceAbstractionStarter]: For program point L3453-2(lines 3453 3457) no Hoare annotation was computed. [2018-11-18 16:19:50,877 INFO L428 ceAbstractionStarter]: At program point usb_make_pathENTRY(lines 3445 3460) the Hoare annotation is: true [2018-11-18 16:19:50,877 INFO L425 ceAbstractionStarter]: For program point usb_make_pathFINAL(lines 3445 3460) no Hoare annotation was computed. [2018-11-18 16:19:50,878 INFO L421 ceAbstractionStarter]: At program point L4210(line 4210) the Hoare annotation is: (or (< ~ldv_coherent_state~0 1) (not (= ~res_kbtab_probe_3~0 0)) (< |old(~ldv_urb_state~0)| 1)) [2018-11-18 16:19:50,878 INFO L425 ceAbstractionStarter]: For program point L4206(lines 4206 4212) no Hoare annotation was computed. [2018-11-18 16:19:50,878 INFO L425 ceAbstractionStarter]: For program point L4210-1(lines 4206 4212) no Hoare annotation was computed. [2018-11-18 16:19:50,878 INFO L425 ceAbstractionStarter]: For program point L4198(lines 4196 4218) no Hoare annotation was computed. [2018-11-18 16:19:50,878 INFO L425 ceAbstractionStarter]: For program point usb_free_urbEXIT(lines 4191 4224) no Hoare annotation was computed. [2018-11-18 16:19:50,878 INFO L428 ceAbstractionStarter]: At program point L4200(line 4200) the Hoare annotation is: true [2018-11-18 16:19:50,878 INFO L421 ceAbstractionStarter]: At program point L4196loopEntry(lines 4196 4218) the Hoare annotation is: (or (< ~ldv_coherent_state~0 1) (not (= ~res_kbtab_probe_3~0 0)) (< |old(~ldv_urb_state~0)| 1) (= |old(~ldv_urb_state~0)| ~ldv_urb_state~0)) [2018-11-18 16:19:50,878 INFO L421 ceAbstractionStarter]: At program point usb_free_urbENTRY(lines 4191 4224) the Hoare annotation is: (or (< ~ldv_coherent_state~0 1) (not (= ~res_kbtab_probe_3~0 0)) (< |old(~ldv_urb_state~0)| 1) (= |old(~ldv_urb_state~0)| ~ldv_urb_state~0)) [2018-11-18 16:19:50,878 INFO L425 ceAbstractionStarter]: For program point L4196-1(lines 4196 4218) no Hoare annotation was computed. [2018-11-18 16:19:50,878 INFO L421 ceAbstractionStarter]: At program point L4219(lines 4191 4224) the Hoare annotation is: (or (let ((.cse0 (+ ~ldv_urb_state~0 1))) (and (< 0 .cse0) (<= .cse0 |old(~ldv_urb_state~0)|) (let ((.cse1 (div (+ usb_free_urb_~urb.base usb_free_urb_~urb.offset) 18446744073709551616))) (or (<= (+ .cse1 1) 0) (< (* 18446744073709551616 .cse1) (+ usb_free_urb_~urb.offset usb_free_urb_~urb.base)))))) (< ~ldv_coherent_state~0 1) (not (= ~res_kbtab_probe_3~0 0)) (< |old(~ldv_urb_state~0)| 1)) [2018-11-18 16:19:50,878 INFO L425 ceAbstractionStarter]: For program point L4197(lines 4196 4218) no Hoare annotation was computed. [2018-11-18 16:19:50,878 INFO L428 ceAbstractionStarter]: At program point __create_pipeENTRY(lines 3505 3511) the Hoare annotation is: true [2018-11-18 16:19:50,879 INFO L425 ceAbstractionStarter]: For program point __create_pipeFINAL(lines 3505 3511) no Hoare annotation was computed. [2018-11-18 16:19:50,879 INFO L425 ceAbstractionStarter]: For program point __create_pipeEXIT(lines 3505 3511) no Hoare annotation was computed. [2018-11-18 16:19:50,879 INFO L425 ceAbstractionStarter]: For program point input_report_keyENTRY(lines 3541 3551) no Hoare annotation was computed. [2018-11-18 16:19:50,879 INFO L425 ceAbstractionStarter]: For program point input_report_keyFINAL(lines 3541 3551) no Hoare annotation was computed. [2018-11-18 16:19:50,879 INFO L425 ceAbstractionStarter]: For program point input_report_keyEXIT(lines 3541 3551) no Hoare annotation was computed. [2018-11-18 16:19:50,879 INFO L425 ceAbstractionStarter]: For program point input_allocate_deviceFINAL(lines 3512 3514) no Hoare annotation was computed. [2018-11-18 16:19:50,879 INFO L428 ceAbstractionStarter]: At program point input_allocate_deviceENTRY(lines 3512 3514) the Hoare annotation is: true [2018-11-18 16:19:50,879 INFO L425 ceAbstractionStarter]: For program point input_allocate_deviceEXIT(lines 3512 3514) no Hoare annotation was computed. [2018-11-18 16:19:50,879 INFO L425 ceAbstractionStarter]: For program point L3513(line 3513) no Hoare annotation was computed. [2018-11-18 16:19:50,879 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 16:19:50,879 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= |old(~ldv_urb_state~0)| ~ldv_urb_state~0)) [2018-11-18 16:19:50,879 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 16:19:50,879 INFO L425 ceAbstractionStarter]: For program point interface_to_usbdevFINAL(lines 3437 3444) no Hoare annotation was computed. [2018-11-18 16:19:50,880 INFO L428 ceAbstractionStarter]: At program point interface_to_usbdevENTRY(lines 3437 3444) the Hoare annotation is: true [2018-11-18 16:19:50,880 INFO L425 ceAbstractionStarter]: For program point interface_to_usbdevEXIT(lines 3437 3444) no Hoare annotation was computed. [2018-11-18 16:19:50,880 INFO L421 ceAbstractionStarter]: At program point usb_alloc_urbENTRY(lines 4163 4189) the Hoare annotation is: (or (= 0 ~ldv_urb_state~0) (< 1 ~ldv_coherent_state~0) (< ~ldv_coherent_state~0 1) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|))) [2018-11-18 16:19:50,880 INFO L425 ceAbstractionStarter]: For program point L4184(lines 4168 4185) no Hoare annotation was computed. [2018-11-18 16:19:50,880 INFO L425 ceAbstractionStarter]: For program point usb_alloc_urbFINAL(lines 4163 4189) no Hoare annotation was computed. [2018-11-18 16:19:50,880 INFO L425 ceAbstractionStarter]: For program point L4175(lines 4175 4179) no Hoare annotation was computed. [2018-11-18 16:19:50,880 INFO L425 ceAbstractionStarter]: For program point L4170(line 4170) no Hoare annotation was computed. [2018-11-18 16:19:50,880 INFO L425 ceAbstractionStarter]: For program point L4169-1(lines 4169 4183) no Hoare annotation was computed. [2018-11-18 16:19:50,880 INFO L421 ceAbstractionStarter]: At program point L4169loopEntry(lines 4169 4183) the Hoare annotation is: (or (= 0 ~ldv_urb_state~0) (< 1 ~ldv_coherent_state~0) (< ~ldv_coherent_state~0 1) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|))) [2018-11-18 16:19:50,880 INFO L425 ceAbstractionStarter]: For program point usb_alloc_urbEXIT(lines 4163 4189) no Hoare annotation was computed. [2018-11-18 16:19:50,880 INFO L428 ceAbstractionStarter]: At program point ldv_check_final_stateENTRY(lines 4226 4246) the Hoare annotation is: true [2018-11-18 16:19:50,880 INFO L421 ceAbstractionStarter]: At program point L4241(line 4241) the Hoare annotation is: (or (not (= 0 ~ldv_urb_state~0)) (not (= 0 ~ldv_coherent_state~0))) [2018-11-18 16:19:50,880 INFO L425 ceAbstractionStarter]: For program point L4241-1(lines 4226 4246) no Hoare annotation was computed. [2018-11-18 16:19:50,881 INFO L421 ceAbstractionStarter]: At program point L4234(line 4234) the Hoare annotation is: (or (not (= 0 ~ldv_urb_state~0)) (not (= 0 ~ldv_coherent_state~0))) [2018-11-18 16:19:50,881 INFO L425 ceAbstractionStarter]: For program point L4234-1(lines 4229 4245) no Hoare annotation was computed. [2018-11-18 16:19:50,881 INFO L425 ceAbstractionStarter]: For program point ldv_check_final_stateEXIT(lines 4226 4246) no Hoare annotation was computed. [2018-11-18 16:19:50,881 INFO L428 ceAbstractionStarter]: At program point usb_registerENTRY(lines 3462 3471) the Hoare annotation is: true [2018-11-18 16:19:50,881 INFO L425 ceAbstractionStarter]: For program point usb_registerEXIT(lines 3462 3471) no Hoare annotation was computed. [2018-11-18 16:19:50,881 INFO L425 ceAbstractionStarter]: For program point usb_registerFINAL(lines 3462 3471) no Hoare annotation was computed. [2018-11-18 16:19:50,881 INFO L425 ceAbstractionStarter]: For program point cleanup_moduleENTRY(lines 3969 3978) no Hoare annotation was computed. [2018-11-18 16:19:50,881 INFO L425 ceAbstractionStarter]: For program point cleanup_moduleEXIT(lines 3969 3978) no Hoare annotation was computed. [2018-11-18 16:19:50,881 INFO L425 ceAbstractionStarter]: For program point cleanup_moduleFINAL(lines 3969 3978) no Hoare annotation was computed. [2018-11-18 16:19:50,881 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 16:19:50,881 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~ldv_urb_state~0) (= 0 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0)) [2018-11-18 16:19:50,881 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 16:19:50,881 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 16:19:50,882 INFO L425 ceAbstractionStarter]: For program point kbtab_closeEXIT(lines 3782 3794) no Hoare annotation was computed. [2018-11-18 16:19:50,882 INFO L425 ceAbstractionStarter]: For program point L3788(line 3788) no Hoare annotation was computed. [2018-11-18 16:19:50,882 INFO L425 ceAbstractionStarter]: For program point kbtab_closeENTRY(lines 3782 3794) no Hoare annotation was computed. [2018-11-18 16:19:50,882 INFO L425 ceAbstractionStarter]: For program point L3788-1(line 3788) no Hoare annotation was computed. [2018-11-18 16:19:50,882 INFO L425 ceAbstractionStarter]: For program point kbtab_closeFINAL(lines 3782 3794) no Hoare annotation was computed. [2018-11-18 16:19:50,882 INFO L425 ceAbstractionStarter]: For program point input_report_absENTRY(lines 3552 3562) no Hoare annotation was computed. [2018-11-18 16:19:50,882 INFO L425 ceAbstractionStarter]: For program point input_report_absEXIT(lines 3552 3562) no Hoare annotation was computed. [2018-11-18 16:19:50,882 INFO L425 ceAbstractionStarter]: For program point input_report_absFINAL(lines 3552 3562) no Hoare annotation was computed. [2018-11-18 16:19:50,882 INFO L425 ceAbstractionStarter]: For program point get_unaligned_le16EXIT(lines 3586 3595) no Hoare annotation was computed. [2018-11-18 16:19:50,882 INFO L425 ceAbstractionStarter]: For program point L3591-1(line 3591) no Hoare annotation was computed. [2018-11-18 16:19:50,882 INFO L425 ceAbstractionStarter]: For program point L3591(line 3591) no Hoare annotation was computed. [2018-11-18 16:19:50,882 INFO L425 ceAbstractionStarter]: For program point get_unaligned_le16ENTRY(lines 3586 3595) no Hoare annotation was computed. [2018-11-18 16:19:50,882 INFO L425 ceAbstractionStarter]: For program point get_unaligned_le16FINAL(lines 3586 3595) no Hoare annotation was computed. [2018-11-18 16:19:50,882 INFO L428 ceAbstractionStarter]: At program point ldv_blast_assertENTRY(lines 4077 4083) the Hoare annotation is: true [2018-11-18 16:19:50,883 INFO L425 ceAbstractionStarter]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4081) no Hoare annotation was computed. [2018-11-18 16:19:50,883 INFO L425 ceAbstractionStarter]: For program point ldv_blast_assertEXIT(lines 4077 4083) no Hoare annotation was computed. [2018-11-18 16:19:50,883 INFO L425 ceAbstractionStarter]: For program point ldv_blast_assertFINAL(lines 4077 4083) no Hoare annotation was computed. [2018-11-18 16:19:50,883 INFO L425 ceAbstractionStarter]: For program point L3747-2(lines 3663 3756) no Hoare annotation was computed. [2018-11-18 16:19:50,883 INFO L425 ceAbstractionStarter]: For program point L3677(lines 3677 3716) no Hoare annotation was computed. [2018-11-18 16:19:50,883 INFO L425 ceAbstractionStarter]: For program point L3731(lines 3731 3735) no Hoare annotation was computed. [2018-11-18 16:19:50,883 INFO L425 ceAbstractionStarter]: For program point L3731-2(lines 3731 3735) no Hoare annotation was computed. [2018-11-18 16:19:50,883 INFO L425 ceAbstractionStarter]: For program point L3723-1(line 3723) no Hoare annotation was computed. [2018-11-18 16:19:50,883 INFO L425 ceAbstractionStarter]: For program point L3723(line 3723) no Hoare annotation was computed. [2018-11-18 16:19:50,883 INFO L425 ceAbstractionStarter]: For program point L3686(lines 3686 3716) no Hoare annotation was computed. [2018-11-18 16:19:50,883 INFO L425 ceAbstractionStarter]: For program point L3719(line 3719) no Hoare annotation was computed. [2018-11-18 16:19:50,883 INFO L425 ceAbstractionStarter]: For program point $Ultimate##9(lines 3690 3715) no Hoare annotation was computed. [2018-11-18 16:19:50,883 INFO L425 ceAbstractionStarter]: For program point kbtab_irqENTRY(lines 3663 3756) no Hoare annotation was computed. [2018-11-18 16:19:50,883 INFO L425 ceAbstractionStarter]: For program point L3728(line 3728) no Hoare annotation was computed. [2018-11-18 16:19:50,884 INFO L425 ceAbstractionStarter]: For program point L3695(lines 3695 3698) no Hoare annotation was computed. [2018-11-18 16:19:50,884 INFO L425 ceAbstractionStarter]: For program point L3720(line 3720) no Hoare annotation was computed. [2018-11-18 16:19:50,884 INFO L425 ceAbstractionStarter]: For program point L3687(lines 3680 3716) no Hoare annotation was computed. [2018-11-18 16:19:50,884 INFO L425 ceAbstractionStarter]: For program point L3720-1(line 3720) no Hoare annotation was computed. [2018-11-18 16:19:50,884 INFO L425 ceAbstractionStarter]: For program point L3683(lines 3683 3716) no Hoare annotation was computed. [2018-11-18 16:19:50,884 INFO L425 ceAbstractionStarter]: For program point L3741(lines 3673 3755) no Hoare annotation was computed. [2018-11-18 16:19:50,884 INFO L425 ceAbstractionStarter]: For program point L3737(lines 3726 3739) no Hoare annotation was computed. [2018-11-18 16:19:50,884 INFO L425 ceAbstractionStarter]: For program point kbtab_irqEXIT(lines 3663 3756) no Hoare annotation was computed. [2018-11-18 16:19:50,884 INFO L425 ceAbstractionStarter]: For program point $Ultimate##10(lines 3690 3715) no Hoare annotation was computed. [2018-11-18 16:19:50,884 INFO L425 ceAbstractionStarter]: For program point L3721(line 3721) no Hoare annotation was computed. [2018-11-18 16:19:50,884 INFO L425 ceAbstractionStarter]: For program point L3680(lines 3680 3716) no Hoare annotation was computed. [2018-11-18 16:19:50,884 INFO L425 ceAbstractionStarter]: For program point L3705(lines 3705 3708) no Hoare annotation was computed. [2018-11-18 16:19:50,884 INFO L425 ceAbstractionStarter]: For program point L3726(lines 3726 3739) no Hoare annotation was computed. [2018-11-18 16:19:50,885 INFO L425 ceAbstractionStarter]: For program point L3722(line 3722) no Hoare annotation was computed. [2018-11-18 16:19:50,885 INFO L425 ceAbstractionStarter]: For program point L3689(lines 3688 3716) no Hoare annotation was computed. [2018-11-18 16:19:50,885 INFO L425 ceAbstractionStarter]: For program point L3722-1(line 3722) no Hoare annotation was computed. [2018-11-18 16:19:50,885 INFO L425 ceAbstractionStarter]: For program point L3718(line 3718) no Hoare annotation was computed. [2018-11-18 16:19:50,885 INFO L425 ceAbstractionStarter]: For program point L3714(lines 3677 3716) no Hoare annotation was computed. [2018-11-18 16:19:50,885 INFO L425 ceAbstractionStarter]: For program point L3747(lines 3747 3753) no Hoare annotation was computed. [2018-11-18 16:19:50,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 04:19:50 BoogieIcfgContainer [2018-11-18 16:19:50,904 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 16:19:50,904 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:19:50,904 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:19:50,905 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:19:50,905 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:19:11" (3/4) ... [2018-11-18 16:19:50,908 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 16:19:50,915 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_fill_int_urb [2018-11-18 16:19:50,915 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure input_get_drvdata [2018-11-18 16:19:50,915 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_init [2018-11-18 16:19:50,915 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_disconnect [2018-11-18 16:19:50,915 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __le16_to_cpup [2018-11-18 16:19:50,915 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_module [2018-11-18 16:19:50,915 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 16:19:50,915 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_get_intfdata [2018-11-18 16:19:50,915 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_exit [2018-11-18 16:19:50,915 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_to_input_id [2018-11-18 16:19:50,915 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2018-11-18 16:19:50,916 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure input_sync [2018-11-18 16:19:50,916 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2018-11-18 16:19:50,916 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2018-11-18 16:19:50,916 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_open [2018-11-18 16:19:50,916 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_coherent [2018-11-18 16:19:50,916 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_alloc_coherent [2018-11-18 16:19:50,916 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_set_intfdata [2018-11-18 16:19:50,916 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_probe [2018-11-18 16:19:50,916 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure input_set_drvdata [2018-11-18 16:19:50,916 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_make_path [2018-11-18 16:19:50,916 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2018-11-18 16:19:50,916 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __create_pipe [2018-11-18 16:19:50,916 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure input_report_key [2018-11-18 16:19:50,916 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure input_allocate_device [2018-11-18 16:19:50,916 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 16:19:50,917 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure interface_to_usbdev [2018-11-18 16:19:50,917 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_alloc_urb [2018-11-18 16:19:50,917 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_final_state [2018-11-18 16:19:50,917 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_register [2018-11-18 16:19:50,917 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup_module [2018-11-18 16:19:50,917 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure input_report_abs [2018-11-18 16:19:50,917 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure get_unaligned_le16 [2018-11-18 16:19:50,917 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_close [2018-11-18 16:19:50,917 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2018-11-18 16:19:50,917 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_irq [2018-11-18 16:19:50,935 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 214 nodes and edges [2018-11-18 16:19:50,936 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 97 nodes and edges [2018-11-18 16:19:50,937 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 46 nodes and edges [2018-11-18 16:19:50,937 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-11-18 16:19:50,938 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-18 16:19:50,938 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-18 16:19:50,939 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 16:19:50,967 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == ldv_urb_state && 0 == ldv_coherent_state) || !(\old(res_kbtab_probe_3) == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) [2018-11-18 16:19:50,967 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(res_kbtab_probe_3) == 0) || !(0 == \old(ldv_urb_state))) || (((0 == ldv_coherent_state && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1)) || (((((1 <= ldv_coherent_state && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && ldv_urb_state <= \old(ldv_urb_state) + 1) && 1 <= ldv_urb_state) && ldv_coherent_state <= \old(ldv_coherent_state) + 1)) || !(0 == \old(ldv_coherent_state)) [2018-11-18 16:19:50,967 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == ldv_urb_state && 0 == ldv_coherent_state) || !(\old(res_kbtab_probe_3) == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) [2018-11-18 16:19:50,969 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((ldv_coherent_state + 1 <= \old(ldv_coherent_state) && 0 < ldv_coherent_state + 1) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || \old(ldv_coherent_state) < 1) || !(res_kbtab_probe_3 == 0)) && ((((ldv_coherent_state + 1 <= \old(ldv_coherent_state) && 0 < ldv_coherent_state + 1) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || \old(ldv_coherent_state) < 1) || !(0 == ldv_urb_state)) [2018-11-18 16:19:50,969 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 < ldv_urb_state + 1 && ldv_urb_state + 1 <= \old(ldv_urb_state)) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) || ldv_coherent_state < 1) || !(res_kbtab_probe_3 == 0)) || \old(ldv_urb_state) < 1 [2018-11-18 16:19:50,969 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((error + 1 <= 0 || 0 < error) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1) && 1 <= ldv_coherent_state) && ldv_coherent_state <= \old(ldv_coherent_state) + 1) || !(res_kbtab_probe_3 == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) [2018-11-18 16:19:50,969 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((error + 1 <= 0 || 0 < error) && 0 < ldv_coherent_state + 1 && ldv_coherent_state <= 0) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1) || !(res_kbtab_probe_3 == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) [2018-11-18 16:19:50,970 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(res_kbtab_probe_3) == 0) || !(0 == \old(ldv_urb_state))) || (((0 == ldv_coherent_state && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1)) || (((((1 <= ldv_coherent_state && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && ldv_urb_state <= \old(ldv_urb_state) + 1) && 1 <= ldv_urb_state) && ldv_coherent_state <= \old(ldv_coherent_state) + 1)) || !(0 == \old(ldv_coherent_state)) [2018-11-18 16:19:50,970 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(res_kbtab_probe_3) == 0) || !(0 == \old(ldv_urb_state))) || (((0 == ldv_coherent_state && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1)) || (((((1 <= ldv_coherent_state && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && ldv_urb_state <= \old(ldv_urb_state) + 1) && 1 <= ldv_urb_state) && ldv_coherent_state <= \old(ldv_coherent_state) + 1)) || !(0 == \old(ldv_coherent_state)) [2018-11-18 16:19:50,970 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(ldv_coherent_state) < 1 || !(res_kbtab_probe_3 == 0)) || \old(ldv_coherent_state) == ldv_coherent_state) && ((\old(ldv_coherent_state) == ldv_coherent_state || \old(ldv_coherent_state) < 1) || !(0 == ldv_urb_state)) [2018-11-18 16:19:50,970 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state < 1 || !(res_kbtab_probe_3 == 0)) || \old(ldv_urb_state) < 1) || \old(ldv_urb_state) == ldv_urb_state [2018-11-18 16:19:50,971 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == ldv_coherent_state || !(res_kbtab_probe_3 == 0)) || !(0 == ldv_urb_state)) || !(0 == \old(ldv_coherent_state)) [2018-11-18 16:19:50,971 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == ldv_urb_state || 1 < ldv_coherent_state) || ldv_coherent_state < 1) || !(res_kbtab_probe_3 == 0)) || !(0 == \old(ldv_urb_state)) [2018-11-18 16:19:50,972 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((error + 1 <= 0 || 0 < error) && 1 <= ldv_coherent_state) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && 1 <= ldv_urb_state) || !(res_kbtab_probe_3 == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) [2018-11-18 16:19:51,016 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_88932ab3-79aa-4282-85da-30258cb257a0/bin-2019/uautomizer/witness.graphml [2018-11-18 16:19:51,016 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:19:51,016 INFO L168 Benchmark]: Toolchain (without parser) took 43913.11 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 481.3 MB). Free memory was 954.8 MB in the beginning and 893.5 MB in the end (delta: 61.4 MB). Peak memory consumption was 542.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:19:51,018 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:19:51,018 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1169.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 954.8 MB in the beginning and 872.2 MB in the end (delta: 82.6 MB). Peak memory consumption was 277.2 MB. Max. memory is 11.5 GB. [2018-11-18 16:19:51,018 INFO L168 Benchmark]: Boogie Preprocessor took 85.61 ms. Allocated memory is still 1.2 GB. Free memory was 872.2 MB in the beginning and 864.4 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. [2018-11-18 16:19:51,018 INFO L168 Benchmark]: RCFGBuilder took 2994.52 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 66.6 MB). Free memory was 864.4 MB in the beginning and 1.0 GB in the end (delta: -146.4 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:19:51,018 INFO L168 Benchmark]: TraceAbstraction took 39549.29 ms. Allocated memory was 1.3 GB in the beginning and 1.5 GB in the end (delta: 238.6 MB). Free memory was 1.0 GB in the beginning and 905.5 MB in the end (delta: 99.5 MB). Peak memory consumption was 338.0 MB. Max. memory is 11.5 GB. [2018-11-18 16:19:51,019 INFO L168 Benchmark]: Witness Printer took 111.42 ms. Allocated memory is still 1.5 GB. Free memory was 905.5 MB in the beginning and 893.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2018-11-18 16:19:51,020 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1169.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 954.8 MB in the beginning and 872.2 MB in the end (delta: 82.6 MB). Peak memory consumption was 277.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.61 ms. Allocated memory is still 1.2 GB. Free memory was 872.2 MB in the beginning and 864.4 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2994.52 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 66.6 MB). Free memory was 864.4 MB in the beginning and 1.0 GB in the end (delta: -146.4 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 39549.29 ms. Allocated memory was 1.3 GB in the beginning and 1.5 GB in the end (delta: 238.6 MB). Free memory was 1.0 GB in the beginning and 905.5 MB in the end (delta: 99.5 MB). Peak memory consumption was 338.0 MB. Max. memory is 11.5 GB. * Witness Printer took 111.42 ms. Allocated memory is still 1.5 GB. Free memory was 905.5 MB in the beginning and 893.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4081]: 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: 4106]: Loop Invariant Derived loop invariant: ((0 == ldv_coherent_state || !(res_kbtab_probe_3 == 0)) || !(0 == ldv_urb_state)) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 4191]: Loop Invariant Derived loop invariant: ((((0 < ldv_urb_state + 1 && ldv_urb_state + 1 <= \old(ldv_urb_state)) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) || ldv_coherent_state < 1) || !(res_kbtab_probe_3 == 0)) || \old(ldv_urb_state) < 1 - InvariantResult [Line: 4169]: Loop Invariant Derived loop invariant: (((0 == ldv_urb_state || 1 < ldv_coherent_state) || ldv_coherent_state < 1) || !(res_kbtab_probe_3 == 0)) || !(0 == \old(ldv_urb_state)) - InvariantResult [Line: 4005]: Loop Invariant Derived loop invariant: (((0 == ldv_urb_state && 0 == ldv_coherent_state) || !(\old(res_kbtab_probe_3) == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 4128]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state + 1 <= \old(ldv_coherent_state) && 0 < ldv_coherent_state + 1) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || \old(ldv_coherent_state) < 1) || !(res_kbtab_probe_3 == 0)) && ((((ldv_coherent_state + 1 <= \old(ldv_coherent_state) && 0 < ldv_coherent_state + 1) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || \old(ldv_coherent_state) < 1) || !(0 == ldv_urb_state)) - InvariantResult [Line: 4006]: Loop Invariant Derived loop invariant: (((!(\old(res_kbtab_probe_3) == 0) || !(0 == \old(ldv_urb_state))) || (((0 == ldv_coherent_state && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1)) || (((((1 <= ldv_coherent_state && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && ldv_urb_state <= \old(ldv_urb_state) + 1) && 1 <= ldv_urb_state) && ldv_coherent_state <= \old(ldv_coherent_state) + 1)) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 3807]: Loop Invariant Derived loop invariant: (((((error + 1 <= 0 || 0 < error) && 0 < ldv_coherent_state + 1 && ldv_coherent_state <= 0) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1) || !(res_kbtab_probe_3 == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 4196]: Loop Invariant Derived loop invariant: ((ldv_coherent_state < 1 || !(res_kbtab_probe_3 == 0)) || \old(ldv_urb_state) < 1) || \old(ldv_urb_state) == ldv_urb_state - InvariantResult [Line: 4133]: Loop Invariant Derived loop invariant: ((\old(ldv_coherent_state) < 1 || !(res_kbtab_probe_3 == 0)) || \old(ldv_coherent_state) == ldv_coherent_state) && ((\old(ldv_coherent_state) == ldv_coherent_state || \old(ldv_coherent_state) < 1) || !(0 == ldv_urb_state)) - InvariantResult [Line: 3993]: Loop Invariant Derived loop invariant: (((0 == ldv_urb_state && 0 == ldv_coherent_state) || !(\old(res_kbtab_probe_3) == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 4025]: Loop Invariant Derived loop invariant: (((!(\old(res_kbtab_probe_3) == 0) || !(0 == \old(ldv_urb_state))) || (((0 == ldv_coherent_state && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1)) || (((((1 <= ldv_coherent_state && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && ldv_urb_state <= \old(ldv_urb_state) + 1) && 1 <= ldv_urb_state) && ldv_coherent_state <= \old(ldv_coherent_state) + 1)) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 3807]: Loop Invariant Derived loop invariant: ((((((error + 1 <= 0 || 0 < error) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1) && 1 <= ldv_coherent_state) && ldv_coherent_state <= \old(ldv_coherent_state) + 1) || !(res_kbtab_probe_3 == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 3931]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3807]: Loop Invariant Derived loop invariant: (((((((error + 1 <= 0 || 0 < error) && 1 <= ldv_coherent_state) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && 1 <= ldv_urb_state) || !(res_kbtab_probe_3 == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 4022]: Loop Invariant Derived loop invariant: (((!(\old(res_kbtab_probe_3) == 0) || !(0 == \old(ldv_urb_state))) || (((0 == ldv_coherent_state && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1)) || (((((1 <= ldv_coherent_state && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && ldv_urb_state <= \old(ldv_urb_state) + 1) && 1 <= ldv_urb_state) && ldv_coherent_state <= \old(ldv_coherent_state) + 1)) || !(0 == \old(ldv_coherent_state)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 37 procedures, 255 locations, 1 error locations. SAFE Result, 39.4s OverallTime, 20 OverallIterations, 3 TraceHistogramMax, 33.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 4100 SDtfs, 3588 SDslu, 8259 SDs, 0 SdLazy, 2556 SolverSat, 1132 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 32.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 654 GetRequests, 533 SyntacticMatches, 12 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=832occurred in iteration=11, 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.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 394 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 70 LocationsWithAnnotation, 3013 PreInvPairs, 3081 NumberOfFragments, 1395 HoareAnnotationTreeSize, 3013 FomulaSimplifications, 6696 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 70 FomulaSimplificationsInter, 3409 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2652 NumberOfCodeBlocks, 2652 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2629 ConstructedInterpolants, 0 QuantifiedInterpolants, 809420 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3000 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 23 InterpolantComputations, 18 PerfectInterpolantSequences, 218/254 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...