./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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_08c3652c-24a7-4574-a704-0a422826527f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_08c3652c-24a7-4574-a704-0a422826527f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_08c3652c-24a7-4574-a704-0a422826527f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_08c3652c-24a7-4574-a704-0a422826527f/bin-2019/utaipan/config/TaipanReach.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_08c3652c-24a7-4574-a704-0a422826527f/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Default-EXP.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_08c3652c-24a7-4574-a704-0a422826527f/bin-2019/utaipan --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 Taipan --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-1dbac8b [2018-11-10 07:17:40,082 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:17:40,083 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:17:40,091 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:17:40,091 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:17:40,091 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:17:40,092 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:17:40,093 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:17:40,095 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:17:40,095 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:17:40,096 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:17:40,096 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:17:40,096 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:17:40,097 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:17:40,098 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:17:40,098 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:17:40,099 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:17:40,100 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:17:40,101 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:17:40,103 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:17:40,103 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:17:40,104 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:17:40,106 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:17:40,106 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:17:40,106 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:17:40,107 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:17:40,107 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:17:40,108 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:17:40,108 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:17:40,109 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:17:40,109 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:17:40,110 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:17:40,110 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:17:40,110 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:17:40,111 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:17:40,111 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:17:40,111 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_08c3652c-24a7-4574-a704-0a422826527f/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-10 07:17:40,121 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:17:40,121 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:17:40,122 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:17:40,122 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 07:17:40,122 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 07:17:40,122 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 07:17:40,122 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-10 07:17:40,122 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 07:17:40,123 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-10 07:17:40,123 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 07:17:40,123 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-10 07:17:40,123 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 07:17:40,123 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 07:17:40,123 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 07:17:40,124 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:17:40,124 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:17:40,124 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:17:40,124 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:17:40,125 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:17:40,125 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:17:40,125 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:17:40,125 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:17:40,125 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:17:40,125 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:17:40,126 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:17:40,126 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 07:17:40,126 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:17:40,126 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:17:40,126 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:17:40,126 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:17:40,126 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 07:17:40,127 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:17:40,127 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:17:40,127 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 07:17:40,127 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-10 07:17:40,127 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_08c3652c-24a7-4574-a704-0a422826527f/bin-2019/utaipan 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 -> Taipan 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-10 07:17:40,149 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:17:40,156 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:17:40,158 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:17:40,159 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:17:40,159 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:17:40,159 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_08c3652c-24a7-4574-a704-0a422826527f/bin-2019/utaipan/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i.pp.i [2018-11-10 07:17:40,196 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_08c3652c-24a7-4574-a704-0a422826527f/bin-2019/utaipan/data/d9f051bd9/ae62869bcf774d658f14804c7419cefd/FLAGaa6615374 [2018-11-10 07:17:40,697 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:17:40,698 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_08c3652c-24a7-4574-a704-0a422826527f/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i.pp.i [2018-11-10 07:17:40,715 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_08c3652c-24a7-4574-a704-0a422826527f/bin-2019/utaipan/data/d9f051bd9/ae62869bcf774d658f14804c7419cefd/FLAGaa6615374 [2018-11-10 07:17:40,726 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_08c3652c-24a7-4574-a704-0a422826527f/bin-2019/utaipan/data/d9f051bd9/ae62869bcf774d658f14804c7419cefd [2018-11-10 07:17:40,729 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:17:40,730 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:17:40,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:17:40,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:17:40,734 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:17:40,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:17:40" (1/1) ... [2018-11-10 07:17:40,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fb1b2c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:40, skipping insertion in model container [2018-11-10 07:17:40,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:17:40" (1/1) ... [2018-11-10 07:17:40,742 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:17:40,791 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:17:41,378 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:17:41,512 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:17:41,668 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:17:41,708 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:17:41,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:41 WrapperNode [2018-11-10 07:17:41,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:17:41,709 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:17:41,709 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:17:41,710 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:17:41,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:41" (1/1) ... [2018-11-10 07:17:41,735 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:41" (1/1) ... [2018-11-10 07:17:41,779 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:17:41,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:17:41,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:17:41,780 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:17:41,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:41" (1/1) ... [2018-11-10 07:17:41,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:41" (1/1) ... [2018-11-10 07:17:41,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:41" (1/1) ... [2018-11-10 07:17:41,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:41" (1/1) ... [2018-11-10 07:17:41,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:41" (1/1) ... [2018-11-10 07:17:41,835 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:41" (1/1) ... [2018-11-10 07:17:41,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:41" (1/1) ... [2018-11-10 07:17:41,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:17:41,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:17:41,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:17:41,852 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:17:41,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_08c3652c-24a7-4574-a704-0a422826527f/bin-2019/utaipan/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-10 07:17:41,893 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2018-11-10 07:17:41,894 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2018-11-10 07:17:41,894 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_disconnect [2018-11-10 07:17:41,894 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_disconnect [2018-11-10 07:17:41,894 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 07:17:41,894 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 07:17:41,894 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2018-11-10 07:17:41,894 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2018-11-10 07:17:41,894 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2018-11-10 07:17:41,894 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2018-11-10 07:17:41,895 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2018-11-10 07:17:41,895 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2018-11-10 07:17:41,895 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2018-11-10 07:17:41,895 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2018-11-10 07:17:41,895 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_probe [2018-11-10 07:17:41,895 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_probe [2018-11-10 07:17:41,895 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2018-11-10 07:17:41,895 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2018-11-10 07:17:41,895 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2018-11-10 07:17:41,896 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2018-11-10 07:17:41,896 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2018-11-10 07:17:41,896 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2018-11-10 07:17:41,896 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2018-11-10 07:17:41,896 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2018-11-10 07:17:41,896 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2018-11-10 07:17:41,896 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2018-11-10 07:17:41,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2018-11-10 07:17:41,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2018-11-10 07:17:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2018-11-10 07:17:41,897 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2018-11-10 07:17:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2018-11-10 07:17:41,897 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2018-11-10 07:17:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2018-11-10 07:17:41,897 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2018-11-10 07:17:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2018-11-10 07:17:41,897 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2018-11-10 07:17:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2018-11-10 07:17:41,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2018-11-10 07:17:41,898 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2018-11-10 07:17:41,898 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2018-11-10 07:17:41,898 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2018-11-10 07:17:41,898 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2018-11-10 07:17:41,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 07:17:41,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 07:17:41,898 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2018-11-10 07:17:41,898 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2018-11-10 07:17:41,898 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2018-11-10 07:17:41,899 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2018-11-10 07:17:41,899 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-11-10 07:17:41,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-11-10 07:17:41,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:17:41,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:17:42,220 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 07:17:42,221 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 07:17:44,662 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:17:44,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:17:44 BoogieIcfgContainer [2018-11-10 07:17:44,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:17:44,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 07:17:44,664 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 07:17:44,666 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 07:17:44,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:17:40" (1/3) ... [2018-11-10 07:17:44,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549d389b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:17:44, skipping insertion in model container [2018-11-10 07:17:44,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:41" (2/3) ... [2018-11-10 07:17:44,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549d389b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:17:44, skipping insertion in model container [2018-11-10 07:17:44,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:17:44" (3/3) ... [2018-11-10 07:17:44,669 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i.pp.i [2018-11-10 07:17:44,675 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 07:17:44,681 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 07:17:44,691 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 07:17:44,714 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 07:17:44,714 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 07:17:44,714 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 07:17:44,714 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:17:44,714 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:17:44,715 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 07:17:44,715 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:17:44,715 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 07:17:44,730 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states. [2018-11-10 07:17:44,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 07:17:44,735 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:17:44,735 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-10 07:17:44,737 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:17:44,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:44,742 INFO L82 PathProgramCache]: Analyzing trace with hash -726269618, now seen corresponding path program 1 times [2018-11-10 07:17:44,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:17:44,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:44,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:44,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:44,784 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:17:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:17:45,001 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-10 07:17:45,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:17:45,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:17:45,004 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:17:45,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:17:45,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:17:45,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:17:45,017 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 3 states. [2018-11-10 07:17:45,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:17:45,114 INFO L93 Difference]: Finished difference Result 489 states and 632 transitions. [2018-11-10 07:17:45,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:17:45,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 07:17:45,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:17:45,126 INFO L225 Difference]: With dead ends: 489 [2018-11-10 07:17:45,126 INFO L226 Difference]: Without dead ends: 313 [2018-11-10 07:17:45,129 INFO L605 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-10 07:17:45,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-11-10 07:17:45,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 309. [2018-11-10 07:17:45,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-11-10 07:17:45,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 362 transitions. [2018-11-10 07:17:45,181 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 362 transitions. Word has length 23 [2018-11-10 07:17:45,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:17:45,182 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 362 transitions. [2018-11-10 07:17:45,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:17:45,182 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 362 transitions. [2018-11-10 07:17:45,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 07:17:45,182 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:17:45,183 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-10 07:17:45,183 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:17:45,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:45,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1039646234, now seen corresponding path program 1 times [2018-11-10 07:17:45,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:17:45,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:45,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:45,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:45,187 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:17:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:17:45,255 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-10 07:17:45,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:17:45,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:17:45,255 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:17:45,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:17:45,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:17:45,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:17:45,257 INFO L87 Difference]: Start difference. First operand 309 states and 362 transitions. Second operand 3 states. [2018-11-10 07:17:45,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:17:45,303 INFO L93 Difference]: Finished difference Result 886 states and 1055 transitions. [2018-11-10 07:17:45,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:17:45,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 07:17:45,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:17:45,308 INFO L225 Difference]: With dead ends: 886 [2018-11-10 07:17:45,308 INFO L226 Difference]: Without dead ends: 589 [2018-11-10 07:17:45,310 INFO L605 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-10 07:17:45,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-11-10 07:17:45,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 582. [2018-11-10 07:17:45,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-11-10 07:17:45,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 686 transitions. [2018-11-10 07:17:45,342 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 686 transitions. Word has length 24 [2018-11-10 07:17:45,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:17:45,342 INFO L481 AbstractCegarLoop]: Abstraction has 582 states and 686 transitions. [2018-11-10 07:17:45,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:17:45,342 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 686 transitions. [2018-11-10 07:17:45,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 07:17:45,343 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:17:45,343 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-10 07:17:45,343 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:17:45,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:45,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1890177297, now seen corresponding path program 1 times [2018-11-10 07:17:45,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:17:45,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:45,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:45,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:45,346 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:17:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:17:45,430 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-10 07:17:45,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:17:45,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:17:45,430 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:17:45,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:17:45,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:17:45,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:17:45,431 INFO L87 Difference]: Start difference. First operand 582 states and 686 transitions. Second operand 3 states. [2018-11-10 07:17:45,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:17:45,487 INFO L93 Difference]: Finished difference Result 1185 states and 1415 transitions. [2018-11-10 07:17:45,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:17:45,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-10 07:17:45,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:17:45,491 INFO L225 Difference]: With dead ends: 1185 [2018-11-10 07:17:45,491 INFO L226 Difference]: Without dead ends: 621 [2018-11-10 07:17:45,493 INFO L605 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-10 07:17:45,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2018-11-10 07:17:45,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2018-11-10 07:17:45,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2018-11-10 07:17:45,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 736 transitions. [2018-11-10 07:17:45,519 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 736 transitions. Word has length 48 [2018-11-10 07:17:45,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:17:45,519 INFO L481 AbstractCegarLoop]: Abstraction has 621 states and 736 transitions. [2018-11-10 07:17:45,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:17:45,520 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 736 transitions. [2018-11-10 07:17:45,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 07:17:45,522 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:17:45,522 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-10 07:17:45,522 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:17:45,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:45,522 INFO L82 PathProgramCache]: Analyzing trace with hash -519938551, now seen corresponding path program 1 times [2018-11-10 07:17:45,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:17:45,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:45,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:45,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:45,525 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:17:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:17:45,668 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-10 07:17:45,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:17:45,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:17:45,669 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:17:45,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:17:45,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:17:45,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:17:45,671 INFO L87 Difference]: Start difference. First operand 621 states and 736 transitions. Second operand 5 states. [2018-11-10 07:17:45,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:17:45,701 INFO L93 Difference]: Finished difference Result 939 states and 1117 transitions. [2018-11-10 07:17:45,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:17:45,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-11-10 07:17:45,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:17:45,706 INFO L225 Difference]: With dead ends: 939 [2018-11-10 07:17:45,706 INFO L226 Difference]: Without dead ends: 629 [2018-11-10 07:17:45,707 INFO L605 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-10 07:17:45,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-11-10 07:17:45,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2018-11-10 07:17:45,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2018-11-10 07:17:45,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 744 transitions. [2018-11-10 07:17:45,729 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 744 transitions. Word has length 83 [2018-11-10 07:17:45,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:17:45,729 INFO L481 AbstractCegarLoop]: Abstraction has 629 states and 744 transitions. [2018-11-10 07:17:45,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:17:45,729 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 744 transitions. [2018-11-10 07:17:45,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 07:17:45,731 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:17:45,731 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-10 07:17:45,731 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:17:45,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:45,732 INFO L82 PathProgramCache]: Analyzing trace with hash -896593080, now seen corresponding path program 1 times [2018-11-10 07:17:45,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:17:45,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:45,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:45,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:45,735 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:17:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:17:45,844 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-10 07:17:45,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:17:45,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:17:45,844 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:17:45,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:17:45,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:17:45,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:17:45,845 INFO L87 Difference]: Start difference. First operand 629 states and 744 transitions. Second operand 5 states. [2018-11-10 07:17:45,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:17:45,883 INFO L93 Difference]: Finished difference Result 1040 states and 1234 transitions. [2018-11-10 07:17:45,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:17:45,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-11-10 07:17:45,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:17:45,885 INFO L225 Difference]: With dead ends: 1040 [2018-11-10 07:17:45,886 INFO L226 Difference]: Without dead ends: 430 [2018-11-10 07:17:45,887 INFO L605 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-10 07:17:45,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-11-10 07:17:45,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2018-11-10 07:17:45,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-11-10 07:17:45,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 502 transitions. [2018-11-10 07:17:45,899 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 502 transitions. Word has length 89 [2018-11-10 07:17:45,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:17:45,900 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 502 transitions. [2018-11-10 07:17:45,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:17:45,900 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 502 transitions. [2018-11-10 07:17:45,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 07:17:45,901 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:17:45,902 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-10 07:17:45,902 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:17:45,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:45,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1321164873, now seen corresponding path program 1 times [2018-11-10 07:17:45,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:17:45,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:45,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:45,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:45,907 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:17:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:17:46,037 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-10 07:17:46,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:17:46,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 07:17:46,038 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:17:46,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 07:17:46,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:17:46,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:17:46,038 INFO L87 Difference]: Start difference. First operand 430 states and 502 transitions. Second operand 6 states. [2018-11-10 07:17:47,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:17:47,694 INFO L93 Difference]: Finished difference Result 781 states and 919 transitions. [2018-11-10 07:17:47,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 07:17:47,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-11-10 07:17:47,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:17:47,697 INFO L225 Difference]: With dead ends: 781 [2018-11-10 07:17:47,697 INFO L226 Difference]: Without dead ends: 778 [2018-11-10 07:17:47,698 INFO L605 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-10 07:17:47,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2018-11-10 07:17:47,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 748. [2018-11-10 07:17:47,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2018-11-10 07:17:47,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 887 transitions. [2018-11-10 07:17:47,736 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 887 transitions. Word has length 89 [2018-11-10 07:17:47,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:17:47,737 INFO L481 AbstractCegarLoop]: Abstraction has 748 states and 887 transitions. [2018-11-10 07:17:47,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 07:17:47,737 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 887 transitions. [2018-11-10 07:17:47,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 07:17:47,738 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:17:47,739 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-10 07:17:47,739 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:17:47,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:47,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1035232483, now seen corresponding path program 1 times [2018-11-10 07:17:47,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:17:47,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:47,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:47,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:47,742 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:17:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:17:47,825 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-10 07:17:47,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:17:47,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 07:17:47,826 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:17:47,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 07:17:47,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:17:47,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:17:47,827 INFO L87 Difference]: Start difference. First operand 748 states and 887 transitions. Second operand 6 states. [2018-11-10 07:17:49,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:17:49,181 INFO L93 Difference]: Finished difference Result 1484 states and 1775 transitions. [2018-11-10 07:17:49,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 07:17:49,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-11-10 07:17:49,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:17:49,183 INFO L225 Difference]: With dead ends: 1484 [2018-11-10 07:17:49,184 INFO L226 Difference]: Without dead ends: 746 [2018-11-10 07:17:49,185 INFO L605 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-10 07:17:49,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-11-10 07:17:49,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 725. [2018-11-10 07:17:49,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-11-10 07:17:49,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 871 transitions. [2018-11-10 07:17:49,208 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 871 transitions. Word has length 92 [2018-11-10 07:17:49,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:17:49,208 INFO L481 AbstractCegarLoop]: Abstraction has 725 states and 871 transitions. [2018-11-10 07:17:49,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 07:17:49,208 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 871 transitions. [2018-11-10 07:17:49,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 07:17:49,209 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:17:49,209 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-10 07:17:49,209 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:17:49,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:49,209 INFO L82 PathProgramCache]: Analyzing trace with hash -469119650, now seen corresponding path program 1 times [2018-11-10 07:17:49,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:17:49,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:49,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:49,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:49,211 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:17:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:17:49,288 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-10 07:17:49,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:17:49,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:17:49,288 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:17:49,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:17:49,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:17:49,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:17:49,289 INFO L87 Difference]: Start difference. First operand 725 states and 871 transitions. Second operand 5 states. [2018-11-10 07:17:49,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:17:49,313 INFO L93 Difference]: Finished difference Result 778 states and 931 transitions. [2018-11-10 07:17:49,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:17:49,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-11-10 07:17:49,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:17:49,315 INFO L225 Difference]: With dead ends: 778 [2018-11-10 07:17:49,315 INFO L226 Difference]: Without dead ends: 733 [2018-11-10 07:17:49,316 INFO L605 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-10 07:17:49,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-11-10 07:17:49,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 730. [2018-11-10 07:17:49,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-11-10 07:17:49,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 871 transitions. [2018-11-10 07:17:49,335 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 871 transitions. Word has length 102 [2018-11-10 07:17:49,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:17:49,335 INFO L481 AbstractCegarLoop]: Abstraction has 730 states and 871 transitions. [2018-11-10 07:17:49,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:17:49,335 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 871 transitions. [2018-11-10 07:17:49,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 07:17:49,336 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:17:49,336 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-10 07:17:49,336 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:17:49,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:49,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1943933781, now seen corresponding path program 1 times [2018-11-10 07:17:49,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:17:49,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:49,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:49,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:49,338 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:17:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:17:49,426 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-10 07:17:49,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:17:49,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:17:49,426 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:17:49,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:17:49,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:17:49,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:17:49,427 INFO L87 Difference]: Start difference. First operand 730 states and 871 transitions. Second operand 3 states. [2018-11-10 07:17:49,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:17:49,454 INFO L93 Difference]: Finished difference Result 1352 states and 1637 transitions. [2018-11-10 07:17:49,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:17:49,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-11-10 07:17:49,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:17:49,456 INFO L225 Difference]: With dead ends: 1352 [2018-11-10 07:17:49,456 INFO L226 Difference]: Without dead ends: 681 [2018-11-10 07:17:49,457 INFO L605 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-10 07:17:49,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-11-10 07:17:49,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2018-11-10 07:17:49,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2018-11-10 07:17:49,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 803 transitions. [2018-11-10 07:17:49,475 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 803 transitions. Word has length 103 [2018-11-10 07:17:49,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:17:49,476 INFO L481 AbstractCegarLoop]: Abstraction has 681 states and 803 transitions. [2018-11-10 07:17:49,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:17:49,476 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 803 transitions. [2018-11-10 07:17:49,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-10 07:17:49,476 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:17:49,477 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-10 07:17:49,477 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:17:49,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:49,477 INFO L82 PathProgramCache]: Analyzing trace with hash 220576538, now seen corresponding path program 1 times [2018-11-10 07:17:49,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:17:49,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:49,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:49,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:49,480 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:17:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:17:49,611 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-10 07:17:49,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:17:49,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 07:17:49,611 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:17:49,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 07:17:49,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:17:49,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:17:49,612 INFO L87 Difference]: Start difference. First operand 681 states and 803 transitions. Second operand 6 states. [2018-11-10 07:17:49,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:17:49,659 INFO L93 Difference]: Finished difference Result 1348 states and 1591 transitions. [2018-11-10 07:17:49,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 07:17:49,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-11-10 07:17:49,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:17:49,662 INFO L225 Difference]: With dead ends: 1348 [2018-11-10 07:17:49,663 INFO L226 Difference]: Without dead ends: 681 [2018-11-10 07:17:49,664 INFO L605 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-10 07:17:49,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-11-10 07:17:49,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2018-11-10 07:17:49,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2018-11-10 07:17:49,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 802 transitions. [2018-11-10 07:17:49,692 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 802 transitions. Word has length 105 [2018-11-10 07:17:49,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:17:49,692 INFO L481 AbstractCegarLoop]: Abstraction has 681 states and 802 transitions. [2018-11-10 07:17:49,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 07:17:49,692 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 802 transitions. [2018-11-10 07:17:49,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-10 07:17:49,693 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:17:49,693 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-10 07:17:49,693 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:17:49,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:49,694 INFO L82 PathProgramCache]: Analyzing trace with hash 192076248, now seen corresponding path program 1 times [2018-11-10 07:17:49,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:17:49,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:49,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:49,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:49,697 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:17:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:17:49,891 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-10 07:17:49,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:17:49,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 07:17:49,891 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:17:49,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 07:17:49,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:17:49,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:17:49,892 INFO L87 Difference]: Start difference. First operand 681 states and 802 transitions. Second operand 8 states. [2018-11-10 07:17:52,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:17:52,868 INFO L93 Difference]: Finished difference Result 1394 states and 1732 transitions. [2018-11-10 07:17:52,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 07:17:52,869 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2018-11-10 07:17:52,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:17:52,873 INFO L225 Difference]: With dead ends: 1394 [2018-11-10 07:17:52,873 INFO L226 Difference]: Without dead ends: 1030 [2018-11-10 07:17:52,874 INFO L605 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-10 07:17:52,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2018-11-10 07:17:52,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 832. [2018-11-10 07:17:52,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832 states. [2018-11-10 07:17:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 981 transitions. [2018-11-10 07:17:52,912 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 981 transitions. Word has length 105 [2018-11-10 07:17:52,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:17:52,913 INFO L481 AbstractCegarLoop]: Abstraction has 832 states and 981 transitions. [2018-11-10 07:17:52,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 07:17:52,913 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 981 transitions. [2018-11-10 07:17:52,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 07:17:52,914 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:17:52,914 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-10 07:17:52,914 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:17:52,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:52,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1581124366, now seen corresponding path program 1 times [2018-11-10 07:17:52,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:17:52,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:52,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:52,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:52,917 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:17:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:17:53,021 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-10 07:17:53,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:17:53,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:17:53,021 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:17:53,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:17:53,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:17:53,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:17:53,022 INFO L87 Difference]: Start difference. First operand 832 states and 981 transitions. Second operand 5 states. [2018-11-10 07:17:53,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:17:53,064 INFO L93 Difference]: Finished difference Result 1269 states and 1496 transitions. [2018-11-10 07:17:53,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:17:53,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2018-11-10 07:17:53,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:17:53,067 INFO L225 Difference]: With dead ends: 1269 [2018-11-10 07:17:53,067 INFO L226 Difference]: Without dead ends: 477 [2018-11-10 07:17:53,068 INFO L605 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-10 07:17:53,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-11-10 07:17:53,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2018-11-10 07:17:53,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-11-10 07:17:53,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 552 transitions. [2018-11-10 07:17:53,087 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 552 transitions. Word has length 119 [2018-11-10 07:17:53,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:17:53,088 INFO L481 AbstractCegarLoop]: Abstraction has 477 states and 552 transitions. [2018-11-10 07:17:53,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:17:53,088 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 552 transitions. [2018-11-10 07:17:53,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 07:17:53,089 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:17:53,089 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-10 07:17:53,089 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:17:53,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:53,089 INFO L82 PathProgramCache]: Analyzing trace with hash -119616113, now seen corresponding path program 1 times [2018-11-10 07:17:53,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:17:53,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:53,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:53,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:53,091 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:17:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:17:53,246 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-10 07:17:53,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:17:53,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 07:17:53,246 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:17:53,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 07:17:53,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:17:53,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:17:53,247 INFO L87 Difference]: Start difference. First operand 477 states and 552 transitions. Second operand 6 states. [2018-11-10 07:17:54,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:17:54,988 INFO L93 Difference]: Finished difference Result 773 states and 902 transitions. [2018-11-10 07:17:54,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 07:17:54,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-11-10 07:17:54,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:17:54,992 INFO L225 Difference]: With dead ends: 773 [2018-11-10 07:17:54,992 INFO L226 Difference]: Without dead ends: 768 [2018-11-10 07:17:54,992 INFO L605 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-10 07:17:54,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2018-11-10 07:17:55,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 734. [2018-11-10 07:17:55,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-11-10 07:17:55,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 863 transitions. [2018-11-10 07:17:55,013 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 863 transitions. Word has length 119 [2018-11-10 07:17:55,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:17:55,013 INFO L481 AbstractCegarLoop]: Abstraction has 734 states and 863 transitions. [2018-11-10 07:17:55,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 07:17:55,014 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 863 transitions. [2018-11-10 07:17:55,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-10 07:17:55,014 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:17:55,015 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-10 07:17:55,015 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:17:55,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:55,015 INFO L82 PathProgramCache]: Analyzing trace with hash 2097324131, now seen corresponding path program 1 times [2018-11-10 07:17:55,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:17:55,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:55,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:55,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:55,017 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:17:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:17:55,087 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-10 07:17:55,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:17:55,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:17:55,088 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:17:55,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:17:55,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:17:55,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:17:55,088 INFO L87 Difference]: Start difference. First operand 734 states and 863 transitions. Second operand 5 states. [2018-11-10 07:17:55,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:17:55,127 INFO L93 Difference]: Finished difference Result 772 states and 903 transitions. [2018-11-10 07:17:55,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:17:55,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2018-11-10 07:17:55,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:17:55,129 INFO L225 Difference]: With dead ends: 772 [2018-11-10 07:17:55,129 INFO L226 Difference]: Without dead ends: 755 [2018-11-10 07:17:55,130 INFO L605 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-10 07:17:55,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-11-10 07:17:55,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 738. [2018-11-10 07:17:55,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2018-11-10 07:17:55,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 866 transitions. [2018-11-10 07:17:55,151 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 866 transitions. Word has length 126 [2018-11-10 07:17:55,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:17:55,152 INFO L481 AbstractCegarLoop]: Abstraction has 738 states and 866 transitions. [2018-11-10 07:17:55,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:17:55,152 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 866 transitions. [2018-11-10 07:17:55,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 07:17:55,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:17:55,153 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-10 07:17:55,153 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:17:55,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:55,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1606992820, now seen corresponding path program 1 times [2018-11-10 07:17:55,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:17:55,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:55,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:55,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:55,156 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:17:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:17:55,226 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-10 07:17:55,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:17:55,227 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:17:55,227 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 132 with the following transitions: [2018-11-10 07:17:55,229 INFO L202 CegarAbsIntRunner]: [0], [3], [12], [13], [14], [16], [21], [23], [24], [35], [37], [42], [46], [52], [54], [57], [59], [64], [66], [69], [81], [83], [88], [115], [116], [117], [118], [119], [121], [122], [123], [124], [164], [168], [174], [176], [180], [184], [185], [186], [187], [189], [191], [193], [198], [203], [205], [210], [212], [217], [219], [221], [223], [225], [227], [232], [234], [244], [245], [246], [247], [250], [254], [255], [293], [294], [296], [297], [298], [299], [300], [301], [302], [306], [312], [314], [318], [322], [327], [338], [339], [343], [346], [347], [356], [357], [358], [359], [362], [363], [364], [366], [367], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [402], [403], [404], [408], [409], [410] [2018-11-10 07:17:55,262 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-10 07:17:55,262 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:17:55,891 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 07:17:55,892 INFO L272 AbstractInterpreter]: Visited 119 different actions 135 times. Merged at 8 different actions 8 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 229 variables. [2018-11-10 07:17:55,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:55,902 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 07:17:56,362 INFO L227 lantSequenceWeakener]: Weakened 71 states. On average, predicates are now at 93.41% of their original sizes. [2018-11-10 07:17:56,362 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 07:17:58,295 INFO L415 sIntCurrentIteration]: We unified 130 AI predicates to 130 [2018-11-10 07:17:58,295 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 07:17:58,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:17:58,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [53] imperfect sequences [4] total 55 [2018-11-10 07:17:58,296 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:17:58,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-10 07:17:58,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-10 07:17:58,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=2476, Unknown=0, NotChecked=0, Total=2756 [2018-11-10 07:17:58,298 INFO L87 Difference]: Start difference. First operand 738 states and 866 transitions. Second operand 53 states. [2018-11-10 07:18:46,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:18:46,866 INFO L93 Difference]: Finished difference Result 1922 states and 2244 transitions. [2018-11-10 07:18:46,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-10 07:18:46,866 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 131 [2018-11-10 07:18:46,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:18:46,871 INFO L225 Difference]: With dead ends: 1922 [2018-11-10 07:18:46,871 INFO L226 Difference]: Without dead ends: 1377 [2018-11-10 07:18:46,873 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 146 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1538 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=403, Invalid=4289, Unknown=0, NotChecked=0, Total=4692 [2018-11-10 07:18:46,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2018-11-10 07:18:46,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1278. [2018-11-10 07:18:46,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1278 states. [2018-11-10 07:18:46,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1495 transitions. [2018-11-10 07:18:46,952 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1495 transitions. Word has length 131 [2018-11-10 07:18:46,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:18:46,952 INFO L481 AbstractCegarLoop]: Abstraction has 1278 states and 1495 transitions. [2018-11-10 07:18:46,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-10 07:18:46,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1495 transitions. [2018-11-10 07:18:46,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 07:18:46,954 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:18:46,954 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-10 07:18:46,954 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:18:46,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:46,954 INFO L82 PathProgramCache]: Analyzing trace with hash -509700921, now seen corresponding path program 1 times [2018-11-10 07:18:46,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:18:46,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:46,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:18:46,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:46,957 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:18:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:18:47,074 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-10 07:18:47,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:18:47,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:18:47,074 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:18:47,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:18:47,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:18:47,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:18:47,075 INFO L87 Difference]: Start difference. First operand 1278 states and 1495 transitions. Second operand 3 states. [2018-11-10 07:18:47,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:18:47,119 INFO L93 Difference]: Finished difference Result 1488 states and 1738 transitions. [2018-11-10 07:18:47,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:18:47,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2018-11-10 07:18:47,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:18:47,122 INFO L225 Difference]: With dead ends: 1488 [2018-11-10 07:18:47,122 INFO L226 Difference]: Without dead ends: 437 [2018-11-10 07:18:47,125 INFO L605 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-10 07:18:47,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-11-10 07:18:47,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 419. [2018-11-10 07:18:47,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-11-10 07:18:47,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 467 transitions. [2018-11-10 07:18:47,157 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 467 transitions. Word has length 144 [2018-11-10 07:18:47,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:18:47,157 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 467 transitions. [2018-11-10 07:18:47,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:18:47,157 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 467 transitions. [2018-11-10 07:18:47,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-10 07:18:47,158 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:18:47,159 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-10 07:18:47,159 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:18:47,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:47,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1072865659, now seen corresponding path program 1 times [2018-11-10 07:18:47,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:18:47,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:47,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:18:47,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:47,161 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:18:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:18:47,374 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-10 07:18:47,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:18:47,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 07:18:47,374 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:18:47,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 07:18:47,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:18:47,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:18:47,375 INFO L87 Difference]: Start difference. First operand 419 states and 467 transitions. Second operand 6 states. [2018-11-10 07:18:48,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:18:48,975 INFO L93 Difference]: Finished difference Result 611 states and 677 transitions. [2018-11-10 07:18:48,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 07:18:48,975 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2018-11-10 07:18:48,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:18:48,977 INFO L225 Difference]: With dead ends: 611 [2018-11-10 07:18:48,977 INFO L226 Difference]: Without dead ends: 351 [2018-11-10 07:18:48,978 INFO L605 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-10 07:18:48,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-11-10 07:18:48,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 333. [2018-11-10 07:18:48,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-11-10 07:18:48,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 360 transitions. [2018-11-10 07:18:48,994 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 360 transitions. Word has length 167 [2018-11-10 07:18:48,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:18:48,994 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 360 transitions. [2018-11-10 07:18:48,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 07:18:48,994 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 360 transitions. [2018-11-10 07:18:48,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 07:18:48,995 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:18:48,996 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-10 07:18:48,996 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:18:48,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:48,996 INFO L82 PathProgramCache]: Analyzing trace with hash 733763804, now seen corresponding path program 1 times [2018-11-10 07:18:48,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:18:48,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:48,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:18:48,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:18:48,998 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:18:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:18:49,243 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-10 07:18:49,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:18:49,243 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:18:49,243 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 178 with the following transitions: [2018-11-10 07:18:49,244 INFO L202 CegarAbsIntRunner]: [0], [3], [12], [13], [14], [16], [21], [23], [24], [25], [27], [29], [31], [33], [34], [35], [37], [42], [46], [52], [54], [57], [59], [64], [66], [69], [71], [74], [81], [83], [88], [95], [97], [113], [114], [115], [116], [117], [118], [119], [121], [122], [123], [124], [127], [131], [137], [144], [148], [151], [156], [163], [164], [168], [174], [176], [180], [184], [185], [186], [187], [189], [191], [193], [198], [203], [205], [210], [212], [217], [219], [221], [223], [225], [227], [232], [234], [244], [245], [246], [247], [250], [254], [255], [256], [260], [266], [273], [277], [280], [285], [292], [293], [294], [296], [297], [298], [299], [300], [301], [302], [306], [312], [314], [318], [322], [325], [334], [338], [339], [343], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [366], [367], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [402], [403], [406], [408], [409], [410] [2018-11-10 07:18:49,249 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-10 07:18:49,249 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:18:49,555 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 07:18:49,555 INFO L272 AbstractInterpreter]: Visited 158 different actions 179 times. Merged at 10 different actions 10 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 229 variables. [2018-11-10 07:18:49,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:18:49,562 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 07:18:49,873 INFO L227 lantSequenceWeakener]: Weakened 117 states. On average, predicates are now at 93.31% of their original sizes. [2018-11-10 07:18:49,873 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 07:18:51,918 INFO L415 sIntCurrentIteration]: We unified 176 AI predicates to 176 [2018-11-10 07:18:51,918 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 07:18:51,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:18:51,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [58] imperfect sequences [8] total 64 [2018-11-10 07:18:51,918 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:18:51,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-10 07:18:51,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-10 07:18:51,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=3015, Unknown=0, NotChecked=0, Total=3306 [2018-11-10 07:18:51,920 INFO L87 Difference]: Start difference. First operand 333 states and 360 transitions. Second operand 58 states. [2018-11-10 07:19:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:19:35,719 INFO L93 Difference]: Finished difference Result 369 states and 400 transitions. [2018-11-10 07:19:35,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-10 07:19:35,719 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 177 [2018-11-10 07:19:35,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:19:35,719 INFO L225 Difference]: With dead ends: 369 [2018-11-10 07:19:35,719 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 07:19:35,721 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2053 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=474, Invalid=5846, Unknown=0, NotChecked=0, Total=6320 [2018-11-10 07:19:35,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 07:19:35,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 07:19:35,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 07:19:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 07:19:35,722 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 177 [2018-11-10 07:19:35,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:19:35,722 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:19:35,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-10 07:19:35,722 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:19:35,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 07:19:35,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 07:19:35,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:19:36,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:19:36,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:19:36,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:19:36,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:19:36,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:19:36,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:19:36,533 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 186 [2018-11-10 07:19:36,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:19:36,770 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 29 [2018-11-10 07:19:37,927 WARN L179 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 114 [2018-11-10 07:19:38,370 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 99 [2018-11-10 07:19:38,493 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 51 [2018-11-10 07:19:38,637 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 91 [2018-11-10 07:19:39,301 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 100 [2018-11-10 07:19:39,414 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 1 [2018-11-10 07:19:39,756 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 95 [2018-11-10 07:19:40,093 WARN L179 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 108 [2018-11-10 07:19:40,363 WARN L179 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 99 [2018-11-10 07:19:40,660 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 102 [2018-11-10 07:19:41,111 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 91 [2018-11-10 07:19:41,375 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 102 [2018-11-10 07:19:41,605 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 96 [2018-11-10 07:19:41,876 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 105 [2018-11-10 07:19:42,096 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 95 [2018-11-10 07:19:42,122 INFO L425 ceAbstractionStarter]: For program point L3489(lines 3489 3493) no Hoare annotation was computed. [2018-11-10 07:19:42,122 INFO L425 ceAbstractionStarter]: For program point L3486(lines 3486 3493) no Hoare annotation was computed. [2018-11-10 07:19:42,122 INFO L425 ceAbstractionStarter]: For program point L3489-2(lines 3486 3493) no Hoare annotation was computed. [2018-11-10 07:19:42,122 INFO L425 ceAbstractionStarter]: For program point usb_fill_int_urbFINAL(lines 3473 3497) no Hoare annotation was computed. [2018-11-10 07:19:42,122 INFO L425 ceAbstractionStarter]: For program point usb_fill_int_urbEXIT(lines 3473 3497) no Hoare annotation was computed. [2018-11-10 07:19:42,122 INFO L428 ceAbstractionStarter]: At program point usb_fill_int_urbENTRY(lines 3473 3497) the Hoare annotation is: true [2018-11-10 07:19:42,122 INFO L428 ceAbstractionStarter]: At program point kbtab_initENTRY(lines 3928 3946) the Hoare annotation is: true [2018-11-10 07:19:42,122 INFO L425 ceAbstractionStarter]: For program point L3935(lines 3935 3939) no Hoare annotation was computed. [2018-11-10 07:19:42,122 INFO L425 ceAbstractionStarter]: For program point L3933-1(line 3933) no Hoare annotation was computed. [2018-11-10 07:19:42,122 INFO L428 ceAbstractionStarter]: At program point L3933(line 3933) the Hoare annotation is: true [2018-11-10 07:19:42,122 INFO L425 ceAbstractionStarter]: For program point kbtab_initFINAL(lines 3928 3946) no Hoare annotation was computed. [2018-11-10 07:19:42,122 INFO L428 ceAbstractionStarter]: At program point L3943(lines 3931 3945) the Hoare annotation is: true [2018-11-10 07:19:42,122 INFO L425 ceAbstractionStarter]: For program point kbtab_initEXIT(lines 3928 3946) no Hoare annotation was computed. [2018-11-10 07:19:42,123 INFO L421 ceAbstractionStarter]: At program point L3904(line 3904) the Hoare annotation is: (or (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 1)) (not (= |~#kbtab_driver~0.offset| 0)) (= 0 |#t~string64.base|) (not (= ~res_kbtab_probe_3~0 0)) (= |#t~string66.base| 0) (not (= |#t~string64.offset| 0)) (not (= 1 |old(~ldv_urb_state~0)|)) (not (= 1 |old(~ldv_coherent_state~0)|)) (not (= |#t~string66.offset| 0))) [2018-11-10 07:19:42,123 INFO L425 ceAbstractionStarter]: For program point kbtab_disconnectFINAL(lines 3893 3909) no Hoare annotation was computed. [2018-11-10 07:19:42,123 INFO L425 ceAbstractionStarter]: For program point L3903-1(line 3903) no Hoare annotation was computed. [2018-11-10 07:19:42,123 INFO L421 ceAbstractionStarter]: At program point L3903(line 3903) the Hoare annotation is: (or (and (= ~ldv_urb_state~0 1) (= ~ldv_coherent_state~0 1)) (not (= |~#kbtab_driver~0.offset| 0)) (= 0 |#t~string64.base|) (not (= ~res_kbtab_probe_3~0 0)) (= |#t~string66.base| 0) (not (= |#t~string64.offset| 0)) (not (= 1 |old(~ldv_urb_state~0)|)) (not (= 1 |old(~ldv_coherent_state~0)|)) (not (= |#t~string66.offset| 0))) [2018-11-10 07:19:42,123 INFO L425 ceAbstractionStarter]: For program point L3904-1(line 3904) no Hoare annotation was computed. [2018-11-10 07:19:42,123 INFO L425 ceAbstractionStarter]: For program point L3901-1(line 3901) no Hoare annotation was computed. [2018-11-10 07:19:42,123 INFO L421 ceAbstractionStarter]: At program point L3901(line 3901) the Hoare annotation is: (or (and (= ~ldv_urb_state~0 1) (= ~ldv_coherent_state~0 1)) (not (= |~#kbtab_driver~0.offset| 0)) (= 0 |#t~string64.base|) (not (= ~res_kbtab_probe_3~0 0)) (= |#t~string66.base| 0) (not (= |#t~string64.offset| 0)) (not (= 1 |old(~ldv_urb_state~0)|)) (not (= 1 |old(~ldv_coherent_state~0)|)) (not (= |#t~string66.offset| 0))) [2018-11-10 07:19:42,123 INFO L425 ceAbstractionStarter]: For program point L3899-1(line 3899) no Hoare annotation was computed. [2018-11-10 07:19:42,123 INFO L421 ceAbstractionStarter]: At program point L3899(line 3899) the Hoare annotation is: (or (and (= ~ldv_urb_state~0 1) (= ~ldv_coherent_state~0 1)) (not (= |~#kbtab_driver~0.offset| 0)) (= 0 |#t~string64.base|) (not (= ~res_kbtab_probe_3~0 0)) (= |#t~string66.base| 0) (not (= |#t~string64.offset| 0)) (not (= 1 |old(~ldv_urb_state~0)|)) (not (= 1 |old(~ldv_coherent_state~0)|)) (not (= |#t~string66.offset| 0))) [2018-11-10 07:19:42,124 INFO L421 ceAbstractionStarter]: At program point kbtab_disconnectENTRY(lines 3893 3909) the Hoare annotation is: (or (and (= ~ldv_urb_state~0 1) (= ~ldv_coherent_state~0 1)) (not (= |~#kbtab_driver~0.offset| 0)) (= 0 |#t~string64.base|) (not (= ~res_kbtab_probe_3~0 0)) (= |#t~string66.base| 0) (not (= |#t~string64.offset| 0)) (not (= 1 |old(~ldv_urb_state~0)|)) (not (= 1 |old(~ldv_coherent_state~0)|)) (not (= |#t~string66.offset| 0))) [2018-11-10 07:19:42,124 INFO L425 ceAbstractionStarter]: For program point kbtab_disconnectEXIT(lines 3893 3909) no Hoare annotation was computed. [2018-11-10 07:19:42,124 INFO L425 ceAbstractionStarter]: For program point L3999(lines 3999 4003) no Hoare annotation was computed. [2018-11-10 07:19:42,124 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 3985 4076) no Hoare annotation was computed. [2018-11-10 07:19:42,124 INFO L425 ceAbstractionStarter]: For program point L4049-1(line 4049) no Hoare annotation was computed. [2018-11-10 07:19:42,124 INFO L421 ceAbstractionStarter]: At program point L4049(line 4049) the Hoare annotation is: (or (= 0 |#t~string64.base|) (= |#t~string11.base| 0) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= |#t~string93.offset| 0)) (not (= |#NULL.base| 0)) (not (= |#t~string17.offset| 0)) (not (= |~#kb_pressure_click~0.offset| 0)) (not (= |#t~string47.offset| 0)) (not (= |#t~string96.offset| 0)) (not (= |#NULL.offset| 0)) (= |#t~string17.base| 0) (= |#t~string96.base| 0) (not (= 0 |~#__param_str_kb_pressure_click~0.offset|)) (= 0 |~#kbtab_ids~0.base|) (= 0 |#t~string48.base|) (not (= |#t~string48.offset| 0)) (not (= |old(~LDV_IN_INTERRUPT~0)| 0)) (= |#t~string66.base| 0) (not (= |#t~string66.offset| 0)) (= 0 |~#kb_pressure_click~0.base|) (not (= 0 |#t~string11.offset|)) (= ~__param_kb_pressure_click~0.name.base 0) (= 0 |#t~string47.base|) (not (= |~#kbtab_driver~0.offset| 0)) (not (= |#t~string64.offset| 0)) (not (= ~__param_kb_pressure_click~0.flags 0)) (= 0 |~#__param_str_kb_pressure_click~0.base|) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |~#kbtab_ids~0.offset|)) (and (not (= main_~tmp___8~3 0)) (and (= main_~ldv_s_kbtab_driver_usb_driver~0 1) (= ~ldv_urb_state~0 1)) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_coherent_state~0 1)) (= |#t~string93.base| 0) (not (= ~__param_kb_pressure_click~0.perm 0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 07:19:42,124 INFO L425 ceAbstractionStarter]: For program point L4033-1(line 4033) no Hoare annotation was computed. [2018-11-10 07:19:42,124 INFO L421 ceAbstractionStarter]: At program point L4033(line 4033) the Hoare annotation is: (or (= 0 |#t~string64.base|) (= |#t~string11.base| 0) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= |#t~string93.offset| 0)) (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= main_~ldv_s_kbtab_driver_usb_driver~0 0)) (not (= |#NULL.base| 0)) (not (= |#t~string17.offset| 0)) (not (= |~#kb_pressure_click~0.offset| 0)) (not (= |#t~string47.offset| 0)) (not (= |#t~string96.offset| 0)) (not (= |#NULL.offset| 0)) (= |#t~string17.base| 0) (= |#t~string96.base| 0) (not (= 0 |~#__param_str_kb_pressure_click~0.offset|)) (= 0 |~#kbtab_ids~0.base|) (= 0 |#t~string48.base|) (not (= |#t~string48.offset| 0)) (not (= |old(~LDV_IN_INTERRUPT~0)| 0)) (= |#t~string66.base| 0) (not (= |#t~string66.offset| 0)) (= 0 |~#kb_pressure_click~0.base|) (not (= 0 |#t~string11.offset|)) (= ~__param_kb_pressure_click~0.name.base 0) (= 0 |#t~string47.base|) (not (= |~#kbtab_driver~0.offset| 0)) (not (= |#t~string64.offset| 0)) (not (= ~__param_kb_pressure_click~0.flags 0)) (= 0 |~#__param_str_kb_pressure_click~0.base|) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |~#kbtab_ids~0.offset|)) (= |#t~string93.base| 0) (not (= ~__param_kb_pressure_click~0.perm 0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 07:19:42,124 INFO L425 ceAbstractionStarter]: For program point L4025(lines 4025 4061) no Hoare annotation was computed. [2018-11-10 07:19:42,124 INFO L421 ceAbstractionStarter]: At program point L4063(lines 4005 4064) the Hoare annotation is: (or (= |#t~string11.base| 0) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= |#t~string93.offset| 0)) (and (= 0 ~ldv_urb_state~0) (= 0 ~ldv_coherent_state~0)) (not (= |#NULL.base| 0)) (not (= |#t~string17.offset| 0)) (not (= |~#kb_pressure_click~0.offset| 0)) (not (= |#t~string96.offset| 0)) (not (= |#NULL.offset| 0)) (= |#t~string17.base| 0) (= |#t~string96.base| 0) (= 0 |~#kbtab_ids~0.base|) (= 0 |#t~string48.base|) (not (= |#t~string48.offset| 0)) (not (= |#t~string66.offset| 0)) (= ~__param_kb_pressure_click~0.name.base 0) (= 0 |#t~string47.base|) (not (= |#t~string64.offset| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= |#t~string11.offset| 0)) (= 0 |#t~string64.base|) (not (= |#t~string47.offset| 0)) (not (= 0 |~#__param_str_kb_pressure_click~0.offset|)) (not (= |~#kbtab_ids~0.offset| 0)) (not (= |old(~ldv_coherent_state~0)| 0)) (not (= |old(~LDV_IN_INTERRUPT~0)| 0)) (= |#t~string66.base| 0) (not (= 0 ~__param_kb_pressure_click~0.perm)) (= 0 |~#kb_pressure_click~0.base|) (not (= |~#kbtab_driver~0.offset| 0)) (not (= ~__param_kb_pressure_click~0.flags 0)) (= 0 |~#__param_str_kb_pressure_click~0.base|) (= |#t~string93.base| 0)) [2018-11-10 07:19:42,124 INFO L425 ceAbstractionStarter]: For program point L3997-1(line 3997) no Hoare annotation was computed. [2018-11-10 07:19:42,124 INFO L421 ceAbstractionStarter]: At program point L3997(line 3997) the Hoare annotation is: (or (= 0 |#t~string64.base|) (= |#t~string11.base| 0) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= |#t~string93.offset| 0)) (not (= |#NULL.base| 0)) (not (= |#t~string17.offset| 0)) (not (= |~#kb_pressure_click~0.offset| 0)) (not (= |#t~string47.offset| 0)) (not (= |#t~string96.offset| 0)) (not (= |#NULL.offset| 0)) (= |#t~string17.base| 0) (and (= ~LDV_IN_INTERRUPT~0 1) (= ~ldv_urb_state~0 0) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= ~res_kbtab_probe_3~0 0)) (= |#t~string96.base| 0) (not (= 0 |~#__param_str_kb_pressure_click~0.offset|)) (= 0 |~#kbtab_ids~0.base|) (= 0 |#t~string48.base|) (not (= |#t~string48.offset| 0)) (not (= |old(~LDV_IN_INTERRUPT~0)| 0)) (= |#t~string66.base| 0) (not (= |#t~string66.offset| 0)) (= 0 |~#kb_pressure_click~0.base|) (not (= 0 |#t~string11.offset|)) (= ~__param_kb_pressure_click~0.name.base 0) (= 0 |#t~string47.base|) (not (= |~#kbtab_driver~0.offset| 0)) (not (= |#t~string64.offset| 0)) (not (= ~__param_kb_pressure_click~0.flags 0)) (= 0 |~#__param_str_kb_pressure_click~0.base|) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |~#kbtab_ids~0.offset|)) (= |#t~string93.base| 0) (not (= ~__param_kb_pressure_click~0.perm 0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 07:19:42,125 INFO L421 ceAbstractionStarter]: At program point L4026(lines 4025 4061) the Hoare annotation is: (or (= |#t~string11.base| 0) (not (= |old(~res_kbtab_probe_3~0)| 0)) (and (let ((.cse0 (not (= main_~tmp___8~3 0)))) (or (and (= main_~ldv_s_kbtab_driver_usb_driver~0 1) (= ~ldv_urb_state~0 1) .cse0 (= ~ldv_coherent_state~0 1)) (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) .cse0 (= main_~ldv_s_kbtab_driver_usb_driver~0 0)))) (= 0 ~res_kbtab_probe_3~0)) (not (= |#t~string93.offset| 0)) (not (= |#NULL.base| 0)) (not (= |#t~string17.offset| 0)) (not (= |~#kb_pressure_click~0.offset| 0)) (not (= |#t~string96.offset| 0)) (not (= |#NULL.offset| 0)) (= |#t~string17.base| 0) (= |#t~string96.base| 0) (= 0 |~#kbtab_ids~0.base|) (= 0 |#t~string48.base|) (not (= |#t~string48.offset| 0)) (not (= |#t~string66.offset| 0)) (= ~__param_kb_pressure_click~0.name.base 0) (= 0 |#t~string47.base|) (not (= |#t~string64.offset| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= |#t~string11.offset| 0)) (= 0 |#t~string64.base|) (not (= |#t~string47.offset| 0)) (not (= 0 |~#__param_str_kb_pressure_click~0.offset|)) (not (= |~#kbtab_ids~0.offset| 0)) (not (= |old(~ldv_coherent_state~0)| 0)) (not (= |old(~LDV_IN_INTERRUPT~0)| 0)) (= |#t~string66.base| 0) (not (= 0 ~__param_kb_pressure_click~0.perm)) (= 0 |~#kb_pressure_click~0.base|) (not (= |~#kbtab_driver~0.offset| 0)) (not (= ~__param_kb_pressure_click~0.flags 0)) (= 0 |~#__param_str_kb_pressure_click~0.base|) (= |#t~string93.base| 0)) [2018-11-10 07:19:42,125 INFO L421 ceAbstractionStarter]: At program point L4059(lines 4006 4062) the Hoare annotation is: (or (and (or (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= main_~ldv_s_kbtab_driver_usb_driver~0 0)) (and (= main_~ldv_s_kbtab_driver_usb_driver~0 1) (= ~ldv_urb_state~0 1) (= ~ldv_coherent_state~0 1))) (= 0 ~res_kbtab_probe_3~0)) (= |#t~string11.base| 0) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= |#t~string93.offset| 0)) (not (= |#NULL.base| 0)) (not (= |#t~string17.offset| 0)) (not (= |~#kb_pressure_click~0.offset| 0)) (not (= |#t~string96.offset| 0)) (not (= |#NULL.offset| 0)) (= |#t~string17.base| 0) (= |#t~string96.base| 0) (= 0 |~#kbtab_ids~0.base|) (= 0 |#t~string48.base|) (not (= |#t~string48.offset| 0)) (not (= |#t~string66.offset| 0)) (= ~__param_kb_pressure_click~0.name.base 0) (= 0 |#t~string47.base|) (not (= |#t~string64.offset| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= |#t~string11.offset| 0)) (= 0 |#t~string64.base|) (not (= |#t~string47.offset| 0)) (not (= 0 |~#__param_str_kb_pressure_click~0.offset|)) (not (= |~#kbtab_ids~0.offset| 0)) (not (= |old(~ldv_coherent_state~0)| 0)) (not (= |old(~LDV_IN_INTERRUPT~0)| 0)) (= |#t~string66.base| 0) (not (= 0 ~__param_kb_pressure_click~0.perm)) (= 0 |~#kb_pressure_click~0.base|) (not (= |~#kbtab_driver~0.offset| 0)) (not (= ~__param_kb_pressure_click~0.flags 0)) (= 0 |~#__param_str_kb_pressure_click~0.base|) (= |#t~string93.base| 0)) [2018-11-10 07:19:42,125 INFO L425 ceAbstractionStarter]: For program point L4022(lines 4022 4061) no Hoare annotation was computed. [2018-11-10 07:19:42,125 INFO L425 ceAbstractionStarter]: For program point $Ultimate##18(lines 4029 4060) no Hoare annotation was computed. [2018-11-10 07:19:42,125 INFO L425 ceAbstractionStarter]: For program point L4014(lines 4014 4018) no Hoare annotation was computed. [2018-11-10 07:19:42,125 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 3985 4076) no Hoare annotation was computed. [2018-11-10 07:19:42,125 INFO L425 ceAbstractionStarter]: For program point L4014-1(lines 4011 4018) no Hoare annotation was computed. [2018-11-10 07:19:42,125 INFO L425 ceAbstractionStarter]: For program point $Ultimate##19(lines 4029 4060) no Hoare annotation was computed. [2018-11-10 07:19:42,125 INFO L425 ceAbstractionStarter]: For program point L4072(line 4072) no Hoare annotation was computed. [2018-11-10 07:19:42,125 INFO L421 ceAbstractionStarter]: At program point L4068(lines 3993 4075) the Hoare annotation is: (or (= |#t~string11.base| 0) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= |#t~string93.offset| 0)) (and (= 0 ~ldv_urb_state~0) (= 0 ~ldv_coherent_state~0)) (not (= |#NULL.base| 0)) (not (= |#t~string17.offset| 0)) (not (= |~#kb_pressure_click~0.offset| 0)) (not (= |#t~string96.offset| 0)) (not (= |#NULL.offset| 0)) (= |#t~string17.base| 0) (= |#t~string96.base| 0) (= 0 |~#kbtab_ids~0.base|) (= 0 |#t~string48.base|) (not (= |#t~string48.offset| 0)) (not (= |#t~string66.offset| 0)) (= ~__param_kb_pressure_click~0.name.base 0) (= 0 |#t~string47.base|) (not (= |#t~string64.offset| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= |#t~string11.offset| 0)) (= 0 |#t~string64.base|) (not (= |#t~string47.offset| 0)) (not (= 0 |~#__param_str_kb_pressure_click~0.offset|)) (not (= |~#kbtab_ids~0.offset| 0)) (not (= |old(~ldv_coherent_state~0)| 0)) (not (= |old(~LDV_IN_INTERRUPT~0)| 0)) (= |#t~string66.base| 0) (not (= 0 ~__param_kb_pressure_click~0.perm)) (= 0 |~#kb_pressure_click~0.base|) (not (= |~#kbtab_driver~0.offset| 0)) (not (= ~__param_kb_pressure_click~0.flags 0)) (= 0 |~#__param_str_kb_pressure_click~0.base|) (= |#t~string93.base| 0)) [2018-11-10 07:19:42,125 INFO L425 ceAbstractionStarter]: For program point L4006-1(lines 4006 4062) no Hoare annotation was computed. [2018-11-10 07:19:42,125 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 3985 4076) the Hoare annotation is: (or (= 0 |#t~string64.base|) (= |#t~string11.base| 0) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= |#t~string93.offset| 0)) (not (= |#NULL.base| 0)) (not (= |#t~string17.offset| 0)) (not (= |~#kb_pressure_click~0.offset| 0)) (not (= |#t~string47.offset| 0)) (not (= |#t~string96.offset| 0)) (not (= |#NULL.offset| 0)) (= |#t~string17.base| 0) (= |#t~string96.base| 0) (not (= 0 |~#__param_str_kb_pressure_click~0.offset|)) (= 0 |~#kbtab_ids~0.base|) (= 0 |#t~string48.base|) (not (= |#t~string48.offset| 0)) (and (= ~LDV_IN_INTERRUPT~0 0) (= ~ldv_urb_state~0 0) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= ~res_kbtab_probe_3~0 0)) (not (= |old(~LDV_IN_INTERRUPT~0)| 0)) (= |#t~string66.base| 0) (not (= |#t~string66.offset| 0)) (= 0 |~#kb_pressure_click~0.base|) (not (= 0 |#t~string11.offset|)) (= ~__param_kb_pressure_click~0.name.base 0) (= 0 |#t~string47.base|) (not (= |~#kbtab_driver~0.offset| 0)) (not (= |#t~string64.offset| 0)) (not (= ~__param_kb_pressure_click~0.flags 0)) (= 0 |~#__param_str_kb_pressure_click~0.base|) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |~#kbtab_ids~0.offset|)) (= |#t~string93.base| 0) (not (= ~__param_kb_pressure_click~0.perm 0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 07:19:42,125 INFO L421 ceAbstractionStarter]: At program point L4023(lines 4022 4061) the Hoare annotation is: (or (and (or (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= main_~ldv_s_kbtab_driver_usb_driver~0 0)) (and (= main_~ldv_s_kbtab_driver_usb_driver~0 1) (= ~ldv_urb_state~0 1) (= ~ldv_coherent_state~0 1))) (= 0 ~res_kbtab_probe_3~0)) (= 0 |#t~string64.base|) (= |#t~string11.base| 0) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= |#t~string93.offset| 0)) (not (= |#NULL.base| 0)) (not (= |#t~string17.offset| 0)) (not (= |~#kb_pressure_click~0.offset| 0)) (not (= |#t~string47.offset| 0)) (not (= |#t~string96.offset| 0)) (not (= |#NULL.offset| 0)) (= |#t~string17.base| 0) (= |#t~string96.base| 0) (not (= 0 |~#__param_str_kb_pressure_click~0.offset|)) (= 0 |~#kbtab_ids~0.base|) (= 0 |#t~string48.base|) (not (= |#t~string48.offset| 0)) (not (= |old(~LDV_IN_INTERRUPT~0)| 0)) (= |#t~string66.base| 0) (not (= |#t~string66.offset| 0)) (= 0 |~#kb_pressure_click~0.base|) (not (= 0 |#t~string11.offset|)) (= ~__param_kb_pressure_click~0.name.base 0) (= 0 |#t~string47.base|) (not (= |~#kbtab_driver~0.offset| 0)) (not (= |#t~string64.offset| 0)) (not (= ~__param_kb_pressure_click~0.flags 0)) (= 0 |~#__param_str_kb_pressure_click~0.base|) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |~#kbtab_ids~0.offset|)) (= |#t~string93.base| 0) (not (= ~__param_kb_pressure_click~0.perm 0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 07:19:42,126 INFO L425 ceAbstractionStarter]: For program point L4011(lines 4011 4018) no Hoare annotation was computed. [2018-11-10 07:19:42,126 INFO L425 ceAbstractionStarter]: For program point L4007(line 4007) no Hoare annotation was computed. [2018-11-10 07:19:42,126 INFO L425 ceAbstractionStarter]: For program point L4036(lines 4036 4040) no Hoare annotation was computed. [2018-11-10 07:19:42,126 INFO L425 ceAbstractionStarter]: For program point usb_get_intfdataEXIT(lines 3415 3424) no Hoare annotation was computed. [2018-11-10 07:19:42,126 INFO L428 ceAbstractionStarter]: At program point usb_get_intfdataENTRY(lines 3415 3424) the Hoare annotation is: true [2018-11-10 07:19:42,126 INFO L425 ceAbstractionStarter]: For program point usb_get_intfdataFINAL(lines 3415 3424) no Hoare annotation was computed. [2018-11-10 07:19:42,126 INFO L425 ceAbstractionStarter]: For program point kbtab_exitFINAL(lines 3949 3958) no Hoare annotation was computed. [2018-11-10 07:19:42,126 INFO L428 ceAbstractionStarter]: At program point kbtab_exitENTRY(lines 3949 3958) the Hoare annotation is: true [2018-11-10 07:19:42,126 INFO L425 ceAbstractionStarter]: For program point kbtab_exitEXIT(lines 3949 3958) no Hoare annotation was computed. [2018-11-10 07:19:42,126 INFO L428 ceAbstractionStarter]: At program point usb_to_input_idENTRY(lines 3575 3585) the Hoare annotation is: true [2018-11-10 07:19:42,126 INFO L425 ceAbstractionStarter]: For program point usb_to_input_idFINAL(lines 3575 3585) no Hoare annotation was computed. [2018-11-10 07:19:42,126 INFO L425 ceAbstractionStarter]: For program point usb_to_input_idEXIT(lines 3575 3585) no Hoare annotation was computed. [2018-11-10 07:19:42,127 INFO L421 ceAbstractionStarter]: At program point L3402(line 3402) the Hoare annotation is: (let ((.cse19 (= 0 |#t~string64.base|)) (.cse0 (= |#t~string11.base| 0)) (.cse1 (not (= ~res_kbtab_probe_3~0 0))) (.cse2 (not (= ~LDV_IN_INTERRUPT~0 1))) (.cse3 (not (= |#t~string93.offset| 0))) (.cse4 (not (= |#NULL.base| 0))) (.cse5 (not (= |#t~string17.offset| 0))) (.cse6 (not (= |~#kb_pressure_click~0.offset| 0))) (.cse20 (not (= |#t~string47.offset| 0))) (.cse7 (not (= |#t~string96.offset| 0))) (.cse8 (not (= |#NULL.offset| 0))) (.cse9 (= |#t~string17.base| 0)) (.cse10 (= |#t~string96.base| 0)) (.cse21 (not (= 0 |~#__param_str_kb_pressure_click~0.offset|))) (.cse11 (= 0 |~#kbtab_ids~0.base|)) (.cse12 (= 0 |#t~string48.base|)) (.cse13 (not (= |#t~string48.offset| 0))) (.cse22 (= |#t~string66.base| 0)) (.cse14 (not (= |#t~string66.offset| 0))) (.cse23 (= 0 |~#kb_pressure_click~0.base|)) (.cse15 (= ~__param_kb_pressure_click~0.name.base 0)) (.cse16 (= 0 |#t~string47.base|)) (.cse24 (not (= |~#kbtab_driver~0.offset| 0))) (.cse17 (not (= |#t~string64.offset| 0))) (.cse25 (not (= ~__param_kb_pressure_click~0.flags 0))) (.cse26 (= 0 |~#__param_str_kb_pressure_click~0.base|)) (.cse18 (not (= 0 ~ldv_urb_state~0))) (.cse27 (= |#t~string93.base| 0))) (and (or .cse0 .cse1 .cse2 (not (= |kzalloc_#in~size| 72)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (not (= |kzalloc_#in~flags| 208)) .cse18 (and (= kzalloc_~size 72) (= kzalloc_~flags 208)) (not (= |#t~string11.offset| 0)) .cse19 .cse20 .cse21 (not (= |~#kbtab_ids~0.offset| 0)) (not (= ~ldv_coherent_state~0 0)) .cse22 (not (= 0 ~__param_kb_pressure_click~0.perm)) .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse19 .cse0 .cse1 .cse2 (not (= |kzalloc_#in~size| 1928)) .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 .cse22 (= kzalloc_~size 1928) .cse14 .cse23 (not (= 0 |#t~string11.offset|)) .cse15 .cse16 .cse24 .cse17 .cse25 .cse26 .cse18 (not (= 0 |~#kbtab_ids~0.offset|)) .cse27 (not (= ~__param_kb_pressure_click~0.perm 0)) (not (= 0 ~ldv_coherent_state~0))))) [2018-11-10 07:19:42,127 INFO L425 ceAbstractionStarter]: For program point kzallocEXIT(lines 3397 3406) no Hoare annotation was computed. [2018-11-10 07:19:42,127 INFO L425 ceAbstractionStarter]: For program point L3402-1(line 3402) no Hoare annotation was computed. [2018-11-10 07:19:42,127 INFO L428 ceAbstractionStarter]: At program point kzallocENTRY(lines 3397 3406) the Hoare annotation is: true [2018-11-10 07:19:42,127 INFO L425 ceAbstractionStarter]: For program point kzallocFINAL(lines 3397 3406) no Hoare annotation was computed. [2018-11-10 07:19:42,127 INFO L428 ceAbstractionStarter]: At program point kmallocENTRY(lines 3386 3396) the Hoare annotation is: true [2018-11-10 07:19:42,127 INFO L425 ceAbstractionStarter]: For program point kmallocFINAL(lines 3386 3396) no Hoare annotation was computed. [2018-11-10 07:19:42,128 INFO L425 ceAbstractionStarter]: For program point kmallocEXIT(lines 3386 3396) no Hoare annotation was computed. [2018-11-10 07:19:42,128 INFO L425 ceAbstractionStarter]: For program point ldv_assume_stopFINAL(lines 4087 4094) no Hoare annotation was computed. [2018-11-10 07:19:42,128 INFO L428 ceAbstractionStarter]: At program point ldv_assume_stopENTRY(lines 4087 4094) the Hoare annotation is: true [2018-11-10 07:19:42,128 INFO L425 ceAbstractionStarter]: For program point ldv_assume_stopEXIT(lines 4087 4094) no Hoare annotation was computed. [2018-11-10 07:19:42,128 INFO L421 ceAbstractionStarter]: At program point L4156(lines 4128 4161) the Hoare annotation is: (or (let ((.cse0 (+ ~ldv_coherent_state~0 1))) (and (<= .cse0 |old(~ldv_coherent_state~0)|) (< 0 .cse0) (let ((.cse2 (+ usb_free_coherent_~addr.base usb_free_coherent_~addr.offset))) (let ((.cse1 (div .cse2 18446744073709551616))) (or (< (* 18446744073709551616 .cse1) .cse2) (<= (+ .cse1 1) 0)))))) (< |old(~ldv_coherent_state~0)| 1) (not (= 0 ~ldv_urb_state~0))) [2018-11-10 07:19:42,128 INFO L421 ceAbstractionStarter]: At program point usb_free_coherentENTRY(lines 4128 4161) the Hoare annotation is: (or (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (< |old(~ldv_coherent_state~0)| 1) (not (= 0 ~ldv_urb_state~0))) [2018-11-10 07:19:42,128 INFO L425 ceAbstractionStarter]: For program point L4134(lines 4133 4155) no Hoare annotation was computed. [2018-11-10 07:19:42,128 INFO L425 ceAbstractionStarter]: For program point usb_free_coherentEXIT(lines 4128 4161) no Hoare annotation was computed. [2018-11-10 07:19:42,128 INFO L425 ceAbstractionStarter]: For program point L4147-1(lines 4143 4149) no Hoare annotation was computed. [2018-11-10 07:19:42,128 INFO L421 ceAbstractionStarter]: At program point L4147(line 4147) the Hoare annotation is: (or (< |old(~ldv_coherent_state~0)| 1) (not (= 0 ~ldv_urb_state~0))) [2018-11-10 07:19:42,128 INFO L425 ceAbstractionStarter]: For program point L4143(lines 4143 4149) no Hoare annotation was computed. [2018-11-10 07:19:42,128 INFO L428 ceAbstractionStarter]: At program point L4137(line 4137) the Hoare annotation is: true [2018-11-10 07:19:42,128 INFO L425 ceAbstractionStarter]: For program point L4135(lines 4133 4155) no Hoare annotation was computed. [2018-11-10 07:19:42,129 INFO L425 ceAbstractionStarter]: For program point L4133-1(lines 4133 4155) no Hoare annotation was computed. [2018-11-10 07:19:42,129 INFO L421 ceAbstractionStarter]: At program point L4133loopEntry(lines 4133 4155) the Hoare annotation is: (or (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (< |old(~ldv_coherent_state~0)| 1) (not (= 0 ~ldv_urb_state~0))) [2018-11-10 07:19:42,129 INFO L425 ceAbstractionStarter]: For program point usb_alloc_coherentFINAL(lines 4099 4126) no Hoare annotation was computed. [2018-11-10 07:19:42,129 INFO L421 ceAbstractionStarter]: At program point usb_alloc_coherentENTRY(lines 4099 4126) the Hoare annotation is: (or (= ~ldv_coherent_state~0 0) (not (= |~#kbtab_driver~0.offset| 0)) (= 0 |#t~string64.base|) (not (= ~res_kbtab_probe_3~0 0)) (not (= |usb_alloc_coherent_#in~mem_flags| 208)) (= |#t~string66.base| 0) (not (= |#t~string64.offset| 0)) (not (= 0 ~ldv_urb_state~0)) (not (= |#t~string66.offset| 0)) (not (= |usb_alloc_coherent_#in~size| 8)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 07:19:42,129 INFO L425 ceAbstractionStarter]: For program point L4121(lines 4105 4122) no Hoare annotation was computed. [2018-11-10 07:19:42,129 INFO L425 ceAbstractionStarter]: For program point usb_alloc_coherentEXIT(lines 4099 4126) no Hoare annotation was computed. [2018-11-10 07:19:42,129 INFO L425 ceAbstractionStarter]: For program point L4112(lines 4112 4116) no Hoare annotation was computed. [2018-11-10 07:19:42,129 INFO L421 ceAbstractionStarter]: At program point L4106loopEntry(lines 4106 4120) the Hoare annotation is: (or (= ~ldv_coherent_state~0 0) (not (= |~#kbtab_driver~0.offset| 0)) (= 0 |#t~string64.base|) (not (= ~res_kbtab_probe_3~0 0)) (not (= |usb_alloc_coherent_#in~mem_flags| 208)) (= |#t~string66.base| 0) (not (= |#t~string64.offset| 0)) (not (= 0 ~ldv_urb_state~0)) (not (= |#t~string66.offset| 0)) (not (= |usb_alloc_coherent_#in~size| 8)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 07:19:42,129 INFO L425 ceAbstractionStarter]: For program point L4107(line 4107) no Hoare annotation was computed. [2018-11-10 07:19:42,129 INFO L425 ceAbstractionStarter]: For program point L4106-1(lines 4106 4120) no Hoare annotation was computed. [2018-11-10 07:19:42,129 INFO L428 ceAbstractionStarter]: At program point usb_set_intfdataENTRY(lines 3427 3436) the Hoare annotation is: true [2018-11-10 07:19:42,129 INFO L425 ceAbstractionStarter]: For program point usb_set_intfdataFINAL(lines 3427 3436) no Hoare annotation was computed. [2018-11-10 07:19:42,129 INFO L425 ceAbstractionStarter]: For program point usb_set_intfdataEXIT(lines 3427 3436) no Hoare annotation was computed. [2018-11-10 07:19:42,130 INFO L425 ceAbstractionStarter]: For program point L3809-1(line 3809) no Hoare annotation was computed. [2018-11-10 07:19:42,130 INFO L421 ceAbstractionStarter]: At program point L3809(line 3809) the Hoare annotation is: (or (not (= |~#kbtab_driver~0.offset| 0)) (= 0 |#t~string64.base|) (not (= ~res_kbtab_probe_3~0 0)) (= |#t~string66.base| 0) (not (= |#t~string64.offset| 0)) (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= |#t~string66.offset| 0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 07:19:42,130 INFO L421 ceAbstractionStarter]: At program point L3834(line 3834) the Hoare annotation is: (or (not (= |~#kbtab_driver~0.offset| 0)) (= 0 |#t~string64.base|) (not (= ~res_kbtab_probe_3~0 0)) (= |#t~string66.base| 0) (not (= |#t~string64.offset| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= |#t~string66.offset| 0)) (not (= 0 |old(~ldv_coherent_state~0)|)) (and (<= (+ kbtab_probe_~error~0 12) 0) (let ((.cse0 (= ~ldv_urb_state~0 0))) (or (and .cse0 (not (= kbtab_probe_~kbtab~3.offset 0))) (and .cse0 (not (= kbtab_probe_~kbtab~3.base 0))))) (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0)))) [2018-11-10 07:19:42,130 INFO L425 ceAbstractionStarter]: For program point L3834-1(line 3834) no Hoare annotation was computed. [2018-11-10 07:19:42,130 INFO L421 ceAbstractionStarter]: At program point L3814(line 3814) the Hoare annotation is: (let ((.cse2 (= 0 |#t~string64.base|)) (.cse3 (not (= ~res_kbtab_probe_3~0 0))) (.cse4 (= |#t~string66.base| 0)) (.cse7 (not (= |#t~string66.offset| 0))) (.cse0 (+ kbtab_probe_~error~0 12)) (.cse1 (not (= |~#kbtab_driver~0.offset| 0))) (.cse5 (not (= |#t~string64.offset| 0))) (.cse6 (not (= 0 |old(~ldv_urb_state~0)|))) (.cse8 (not (= 0 |old(~ldv_coherent_state~0)|)))) (and (or (and (<= .cse0 0) (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse2 (= |#t~string11.base| 0) .cse3 (not (= ~LDV_IN_INTERRUPT~0 1)) (not (= |#t~string93.offset| 0)) (not (= |#NULL.base| 0)) (not (= |#t~string17.offset| 0)) (not (= |~#kb_pressure_click~0.offset| 0)) (not (= |#t~string47.offset| 0)) (not (= |#t~string96.offset| 0)) (not (= |#NULL.offset| 0)) (= |#t~string17.base| 0) (= |#t~string96.base| 0) (not (= 0 |~#__param_str_kb_pressure_click~0.offset|)) (= 0 |~#kbtab_ids~0.base|) (= 0 |#t~string48.base|) (not (= |#t~string48.offset| 0)) .cse4 .cse7 (= 0 |~#kb_pressure_click~0.base|) (= .cse0 0) (not (= 0 |#t~string11.offset|)) (= ~__param_kb_pressure_click~0.name.base 0) (= 0 |#t~string47.base|) .cse1 .cse5 (not (= ~__param_kb_pressure_click~0.flags 0)) (= 0 |~#__param_str_kb_pressure_click~0.base|) .cse6 (not (= 0 |~#kbtab_ids~0.offset|)) (= |#t~string93.base| 0) (not (= ~__param_kb_pressure_click~0.perm 0)) .cse8))) [2018-11-10 07:19:42,130 INFO L425 ceAbstractionStarter]: For program point L3814-1(line 3814) no Hoare annotation was computed. [2018-11-10 07:19:42,130 INFO L425 ceAbstractionStarter]: For program point L3868(lines 3868 3872) no Hoare annotation was computed. [2018-11-10 07:19:42,130 INFO L421 ceAbstractionStarter]: At program point L3860(line 3860) the Hoare annotation is: (or (not (= |~#kbtab_driver~0.offset| 0)) (= 0 |#t~string64.base|) (not (= ~res_kbtab_probe_3~0 0)) (= |#t~string66.base| 0) (not (= |#t~string64.offset| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (let ((.cse0 (= ~ldv_urb_state~0 1))) (or (and .cse0 (not (= kbtab_probe_~kbtab~3.offset 0))) (and .cse0 (not (= kbtab_probe_~kbtab~3.base 0))))) (<= (+ kbtab_probe_~error~0 12) 0) (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0))) (not (= |#t~string66.offset| 0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 07:19:42,131 INFO L425 ceAbstractionStarter]: For program point L3860-1(line 3860) no Hoare annotation was computed. [2018-11-10 07:19:42,131 INFO L421 ceAbstractionStarter]: At program point L3885(lines 3807 3891) the Hoare annotation is: (or (not (= |~#kbtab_driver~0.offset| 0)) (= 0 |#t~string64.base|) (not (= ~res_kbtab_probe_3~0 0)) (= |#t~string66.base| 0) (not (= |#t~string64.offset| 0)) (let ((.cse0 (= ~ldv_urb_state~0 0))) (or (and (and (< 0 (+ ~ldv_coherent_state~0 1)) (<= ~ldv_coherent_state~0 0)) (or (and .cse0 (not (= kbtab_probe_~kbtab~3.offset 0))) (and .cse0 (not (= kbtab_probe_~kbtab~3.base 0)))) (not (= 0 kbtab_probe_~error~0))) (and (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) .cse0))) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= |#t~string66.offset| 0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 07:19:42,131 INFO L425 ceAbstractionStarter]: For program point L3819(lines 3819 3823) no Hoare annotation was computed. [2018-11-10 07:19:42,131 INFO L421 ceAbstractionStarter]: At program point L3848(line 3848) the Hoare annotation is: (or (not (= |~#kbtab_driver~0.offset| 0)) (= 0 |#t~string64.base|) (not (= ~res_kbtab_probe_3~0 0)) (= |#t~string66.base| 0) (not (= |#t~string64.offset| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (let ((.cse0 (= ~ldv_urb_state~0 1))) (or (and .cse0 (not (= kbtab_probe_~kbtab~3.offset 0))) (and .cse0 (not (= kbtab_probe_~kbtab~3.base 0))))) (<= (+ kbtab_probe_~error~0 12) 0) (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0))) (not (= |#t~string66.offset| 0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 07:19:42,131 INFO L421 ceAbstractionStarter]: At program point L3881(lines 3807 3891) the Hoare annotation is: (or (and (and (let ((.cse0 (= ~ldv_urb_state~0 0))) (or (and .cse0 (not (= kbtab_probe_~kbtab~3.offset 0))) (and .cse0 (not (= kbtab_probe_~kbtab~3.base 0))))) (not (= 0 kbtab_probe_~error~0))) (= ~ldv_coherent_state~0 1)) (not (= |~#kbtab_driver~0.offset| 0)) (= 0 |#t~string64.base|) (not (= ~res_kbtab_probe_3~0 0)) (= |#t~string66.base| 0) (not (= |#t~string64.offset| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= |#t~string66.offset| 0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 07:19:42,131 INFO L425 ceAbstractionStarter]: For program point L3848-1(line 3848) no Hoare annotation was computed. [2018-11-10 07:19:42,131 INFO L421 ceAbstractionStarter]: At program point L3844(line 3844) the Hoare annotation is: (or (not (= |~#kbtab_driver~0.offset| 0)) (= 0 |#t~string64.base|) (not (= ~res_kbtab_probe_3~0 0)) (= |#t~string66.base| 0) (not (= |#t~string64.offset| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (let ((.cse0 (= ~ldv_urb_state~0 1))) (or (and .cse0 (not (= kbtab_probe_~kbtab~3.offset 0))) (and .cse0 (not (= kbtab_probe_~kbtab~3.base 0))))) (<= (+ kbtab_probe_~error~0 12) 0) (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0))) (not (= |#t~string66.offset| 0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 07:19:42,131 INFO L425 ceAbstractionStarter]: For program point L3844-1(line 3844) no Hoare annotation was computed. [2018-11-10 07:19:42,131 INFO L425 ceAbstractionStarter]: For program point L3836(lines 3836 3840) no Hoare annotation was computed. [2018-11-10 07:19:42,131 INFO L421 ceAbstractionStarter]: At program point L3869(lines 3807 3891) the Hoare annotation is: (or (not (= |~#kbtab_driver~0.offset| 0)) (= 0 |#t~string64.base|) (not (= ~res_kbtab_probe_3~0 0)) (= |#t~string66.base| 0) (not (= |#t~string64.offset| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (let ((.cse0 (= ~ldv_urb_state~0 1))) (or (and .cse0 (not (= kbtab_probe_~kbtab~3.offset 0))) (and .cse0 (not (= kbtab_probe_~kbtab~3.base 0))))) (not (= 0 kbtab_probe_~error~0)) (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0))) (not (= |#t~string66.offset| 0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 07:19:42,131 INFO L421 ceAbstractionStarter]: At program point kbtab_probeENTRY(lines 3795 3892) the Hoare annotation is: (or (not (= |~#kbtab_driver~0.offset| 0)) (= 0 |#t~string64.base|) (not (= ~res_kbtab_probe_3~0 0)) (= |#t~string66.base| 0) (not (= |#t~string64.offset| 0)) (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= |#t~string66.offset| 0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 07:19:42,132 INFO L425 ceAbstractionStarter]: For program point L3828(lines 3828 3832) no Hoare annotation was computed. [2018-11-10 07:19:42,132 INFO L425 ceAbstractionStarter]: For program point L3861-1(lines 3861 3862) no Hoare annotation was computed. [2018-11-10 07:19:42,132 INFO L421 ceAbstractionStarter]: At program point L3861(lines 3861 3862) the Hoare annotation is: (or (not (= |~#kbtab_driver~0.offset| 0)) (= 0 |#t~string64.base|) (not (= ~res_kbtab_probe_3~0 0)) (= |#t~string66.base| 0) (not (= |#t~string64.offset| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (let ((.cse0 (= ~ldv_urb_state~0 1))) (or (and .cse0 (not (= kbtab_probe_~kbtab~3.offset 0))) (and .cse0 (not (= kbtab_probe_~kbtab~3.base 0))))) (<= (+ kbtab_probe_~error~0 12) 0) (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0))) (not (= |#t~string66.offset| 0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 07:19:42,132 INFO L425 ceAbstractionStarter]: For program point kbtab_probeFINAL(lines 3795 3892) no Hoare annotation was computed. [2018-11-10 07:19:42,132 INFO L425 ceAbstractionStarter]: For program point L3816(lines 3816 3823) no Hoare annotation was computed. [2018-11-10 07:19:42,132 INFO L421 ceAbstractionStarter]: At program point L3812(line 3812) the Hoare annotation is: (let ((.cse2 (= 0 |#t~string64.base|)) (.cse3 (not (= ~res_kbtab_probe_3~0 0))) (.cse4 (= |#t~string66.base| 0)) (.cse7 (not (= |#t~string66.offset| 0))) (.cse0 (+ kbtab_probe_~error~0 12)) (.cse1 (not (= |~#kbtab_driver~0.offset| 0))) (.cse5 (not (= |#t~string64.offset| 0))) (.cse6 (not (= 0 |old(~ldv_urb_state~0)|))) (.cse8 (not (= 0 |old(~ldv_coherent_state~0)|)))) (and (or (and (<= .cse0 0) (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse2 (= |#t~string11.base| 0) .cse3 (not (= ~LDV_IN_INTERRUPT~0 1)) (not (= |#t~string93.offset| 0)) (not (= |#NULL.base| 0)) (not (= |#t~string17.offset| 0)) (not (= |~#kb_pressure_click~0.offset| 0)) (not (= |#t~string47.offset| 0)) (not (= |#t~string96.offset| 0)) (not (= |#NULL.offset| 0)) (= |#t~string17.base| 0) (= |#t~string96.base| 0) (not (= 0 |~#__param_str_kb_pressure_click~0.offset|)) (= 0 |~#kbtab_ids~0.base|) (= 0 |#t~string48.base|) (not (= |#t~string48.offset| 0)) .cse4 .cse7 (= 0 |~#kb_pressure_click~0.base|) (= .cse0 0) (not (= 0 |#t~string11.offset|)) (= ~__param_kb_pressure_click~0.name.base 0) (= 0 |#t~string47.base|) .cse1 .cse5 (not (= ~__param_kb_pressure_click~0.flags 0)) (= 0 |~#__param_str_kb_pressure_click~0.base|) .cse6 (not (= 0 |~#kbtab_ids~0.offset|)) (= |#t~string93.base| 0) (not (= ~__param_kb_pressure_click~0.perm 0)) .cse8))) [2018-11-10 07:19:42,132 INFO L421 ceAbstractionStarter]: At program point L3874(line 3874) the Hoare annotation is: (or (not (= |~#kbtab_driver~0.offset| 0)) (= 0 |#t~string64.base|) (not (= ~res_kbtab_probe_3~0 0)) (= |#t~string66.base| 0) (not (= |#t~string64.offset| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= |#t~string66.offset| 0)) (not (= 0 |old(~ldv_coherent_state~0)|)) (and (let ((.cse0 (= ~ldv_urb_state~0 1))) (or (and .cse0 (not (= kbtab_probe_~kbtab~3.offset 0))) (and .cse0 (not (= kbtab_probe_~kbtab~3.base 0))))) (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0)))) [2018-11-10 07:19:42,132 INFO L425 ceAbstractionStarter]: For program point L3812-1(line 3812) no Hoare annotation was computed. [2018-11-10 07:19:42,132 INFO L425 ceAbstractionStarter]: For program point L3874-1(line 3874) no Hoare annotation was computed. [2018-11-10 07:19:42,132 INFO L425 ceAbstractionStarter]: For program point kbtab_probeEXIT(lines 3795 3892) no Hoare annotation was computed. [2018-11-10 07:19:42,132 INFO L425 ceAbstractionStarter]: For program point L3825-1(line 3825) no Hoare annotation was computed. [2018-11-10 07:19:42,132 INFO L421 ceAbstractionStarter]: At program point L3825(line 3825) the Hoare annotation is: (let ((.cse4 (not (= |~#kbtab_driver~0.offset| 0))) (.cse0 (= 0 |#t~string64.base|)) (.cse1 (not (= ~res_kbtab_probe_3~0 0))) (.cse2 (= |#t~string66.base| 0)) (.cse5 (not (= |#t~string64.offset| 0))) (.cse8 (+ kbtab_probe_~error~0 12)) (.cse6 (not (= 0 |old(~ldv_urb_state~0)|))) (.cse3 (not (= |#t~string66.offset| 0))) (.cse7 (not (= 0 |old(~ldv_coherent_state~0)|)))) (and (or .cse0 (= |#t~string11.base| 0) .cse1 (not (= ~LDV_IN_INTERRUPT~0 1)) (not (= |#t~string93.offset| 0)) (not (= |#NULL.base| 0)) (not (= |#t~string17.offset| 0)) (not (= |~#kb_pressure_click~0.offset| 0)) (not (= |#t~string47.offset| 0)) (not (= |#t~string96.offset| 0)) (not (= |#NULL.offset| 0)) (= |#t~string17.base| 0) (= |#t~string96.base| 0) (not (= 0 |~#__param_str_kb_pressure_click~0.offset|)) (= 0 |~#kbtab_ids~0.base|) (= 0 |#t~string48.base|) (not (= |#t~string48.offset| 0)) .cse2 .cse3 (= 0 |~#kb_pressure_click~0.base|) (not (= 0 |#t~string11.offset|)) (= ~__param_kb_pressure_click~0.name.base 0) (= 0 |#t~string47.base|) .cse4 .cse5 (not (= ~__param_kb_pressure_click~0.flags 0)) (= 0 |~#__param_str_kb_pressure_click~0.base|) .cse6 (not (= 0 |~#kbtab_ids~0.offset|)) (= |#t~string93.base| 0) (not (= ~__param_kb_pressure_click~0.perm 0)) .cse7 (= .cse8 0)) (or .cse4 .cse0 .cse1 .cse2 .cse5 (and (<= .cse8 0) (= ~ldv_coherent_state~0 0) (let ((.cse9 (= ~ldv_urb_state~0 0))) (or (and .cse9 (not (= kbtab_probe_~kbtab~3.offset 0))) (and .cse9 (not (= kbtab_probe_~kbtab~3.base 0)))))) .cse6 .cse3 .cse7))) [2018-11-10 07:19:42,132 INFO L421 ceAbstractionStarter]: At program point L3850(line 3850) the Hoare annotation is: (or (not (= |~#kbtab_driver~0.offset| 0)) (= 0 |#t~string64.base|) (not (= ~res_kbtab_probe_3~0 0)) (= |#t~string66.base| 0) (not (= |#t~string64.offset| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (let ((.cse0 (= ~ldv_urb_state~0 1))) (or (and .cse0 (not (= kbtab_probe_~kbtab~3.offset 0))) (and .cse0 (not (= kbtab_probe_~kbtab~3.base 0))))) (<= (+ kbtab_probe_~error~0 12) 0) (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0))) (not (= |#t~string66.offset| 0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 07:19:42,132 INFO L425 ceAbstractionStarter]: For program point L3883-1(line 3883) no Hoare annotation was computed. [2018-11-10 07:19:42,132 INFO L421 ceAbstractionStarter]: At program point L3883(line 3883) the Hoare annotation is: (or (and (and (let ((.cse0 (= ~ldv_urb_state~0 0))) (or (and .cse0 (not (= kbtab_probe_~kbtab~3.offset 0))) (and .cse0 (not (= kbtab_probe_~kbtab~3.base 0))))) (not (= 0 kbtab_probe_~error~0))) (= ~ldv_coherent_state~0 1)) (not (= |~#kbtab_driver~0.offset| 0)) (= 0 |#t~string64.base|) (not (= ~res_kbtab_probe_3~0 0)) (= |#t~string66.base| 0) (not (= |#t~string64.offset| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= |#t~string66.offset| 0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 07:19:42,133 INFO L425 ceAbstractionStarter]: For program point L3850-1(line 3850) no Hoare annotation was computed. [2018-11-10 07:19:42,133 INFO L425 ceAbstractionStarter]: For program point L3879-1(line 3879) no Hoare annotation was computed. [2018-11-10 07:19:42,133 INFO L421 ceAbstractionStarter]: At program point L3879(line 3879) the Hoare annotation is: (or (not (= |~#kbtab_driver~0.offset| 0)) (= 0 |#t~string64.base|) (not (= ~res_kbtab_probe_3~0 0)) (= |#t~string66.base| 0) (not (= |#t~string64.offset| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (let ((.cse0 (= ~ldv_urb_state~0 1))) (or (and .cse0 (not (= kbtab_probe_~kbtab~3.offset 0))) (and .cse0 (not (= kbtab_probe_~kbtab~3.base 0))))) (not (= 0 kbtab_probe_~error~0)) (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0))) (not (= |#t~string66.offset| 0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 07:19:42,133 INFO L428 ceAbstractionStarter]: At program point input_set_drvdataENTRY(lines 3527 3536) the Hoare annotation is: true [2018-11-10 07:19:42,133 INFO L425 ceAbstractionStarter]: For program point input_set_drvdataFINAL(lines 3527 3536) no Hoare annotation was computed. [2018-11-10 07:19:42,133 INFO L425 ceAbstractionStarter]: For program point input_set_drvdataEXIT(lines 3527 3536) no Hoare annotation was computed. [2018-11-10 07:19:42,133 INFO L425 ceAbstractionStarter]: For program point usb_make_pathEXIT(lines 3445 3460) no Hoare annotation was computed. [2018-11-10 07:19:42,133 INFO L425 ceAbstractionStarter]: For program point L3453(lines 3453 3457) no Hoare annotation was computed. [2018-11-10 07:19:42,133 INFO L425 ceAbstractionStarter]: For program point L3453-2(lines 3453 3457) no Hoare annotation was computed. [2018-11-10 07:19:42,133 INFO L428 ceAbstractionStarter]: At program point usb_make_pathENTRY(lines 3445 3460) the Hoare annotation is: true [2018-11-10 07:19:42,133 INFO L425 ceAbstractionStarter]: For program point usb_make_pathFINAL(lines 3445 3460) no Hoare annotation was computed. [2018-11-10 07:19:42,133 INFO L421 ceAbstractionStarter]: At program point L4210(line 4210) the Hoare annotation is: (or (not (= |~#kbtab_driver~0.offset| 0)) (= 0 |#t~string64.base|) (< ~ldv_coherent_state~0 1) (not (= ~res_kbtab_probe_3~0 0)) (= |#t~string66.base| 0) (not (= |#t~string64.offset| 0)) (not (= 1 |old(~ldv_urb_state~0)|)) (not (= |#t~string66.offset| 0))) [2018-11-10 07:19:42,133 INFO L425 ceAbstractionStarter]: For program point L4206(lines 4206 4212) no Hoare annotation was computed. [2018-11-10 07:19:42,133 INFO L425 ceAbstractionStarter]: For program point L4210-1(lines 4206 4212) no Hoare annotation was computed. [2018-11-10 07:19:42,133 INFO L425 ceAbstractionStarter]: For program point L4198(lines 4196 4218) no Hoare annotation was computed. [2018-11-10 07:19:42,133 INFO L425 ceAbstractionStarter]: For program point usb_free_urbEXIT(lines 4191 4224) no Hoare annotation was computed. [2018-11-10 07:19:42,133 INFO L428 ceAbstractionStarter]: At program point L4200(line 4200) the Hoare annotation is: true [2018-11-10 07:19:42,133 INFO L421 ceAbstractionStarter]: At program point L4196loopEntry(lines 4196 4218) the Hoare annotation is: (or (= ~ldv_urb_state~0 1) (not (= |~#kbtab_driver~0.offset| 0)) (= 0 |#t~string64.base|) (< ~ldv_coherent_state~0 1) (not (= ~res_kbtab_probe_3~0 0)) (= |#t~string66.base| 0) (not (= |#t~string64.offset| 0)) (not (= 1 |old(~ldv_urb_state~0)|)) (not (= |#t~string66.offset| 0))) [2018-11-10 07:19:42,133 INFO L421 ceAbstractionStarter]: At program point usb_free_urbENTRY(lines 4191 4224) the Hoare annotation is: (or (= ~ldv_urb_state~0 1) (not (= |~#kbtab_driver~0.offset| 0)) (= 0 |#t~string64.base|) (< ~ldv_coherent_state~0 1) (not (= ~res_kbtab_probe_3~0 0)) (= |#t~string66.base| 0) (not (= |#t~string64.offset| 0)) (not (= 1 |old(~ldv_urb_state~0)|)) (not (= |#t~string66.offset| 0))) [2018-11-10 07:19:42,133 INFO L425 ceAbstractionStarter]: For program point L4196-1(lines 4196 4218) no Hoare annotation was computed. [2018-11-10 07:19:42,134 INFO L421 ceAbstractionStarter]: At program point L4219(lines 4191 4224) the Hoare annotation is: (or (and (= ~ldv_urb_state~0 0) (let ((.cse0 (div (+ usb_free_urb_~urb.base usb_free_urb_~urb.offset) 18446744073709551616))) (or (<= (+ .cse0 1) 0) (< (* 18446744073709551616 .cse0) (+ usb_free_urb_~urb.offset usb_free_urb_~urb.base))))) (not (= |~#kbtab_driver~0.offset| 0)) (= 0 |#t~string64.base|) (< ~ldv_coherent_state~0 1) (not (= ~res_kbtab_probe_3~0 0)) (= |#t~string66.base| 0) (not (= |#t~string64.offset| 0)) (not (= 1 |old(~ldv_urb_state~0)|)) (not (= |#t~string66.offset| 0))) [2018-11-10 07:19:42,134 INFO L425 ceAbstractionStarter]: For program point L4197(lines 4196 4218) no Hoare annotation was computed. [2018-11-10 07:19:42,134 INFO L428 ceAbstractionStarter]: At program point __create_pipeENTRY(lines 3505 3511) the Hoare annotation is: true [2018-11-10 07:19:42,134 INFO L425 ceAbstractionStarter]: For program point __create_pipeFINAL(lines 3505 3511) no Hoare annotation was computed. [2018-11-10 07:19:42,134 INFO L425 ceAbstractionStarter]: For program point __create_pipeEXIT(lines 3505 3511) no Hoare annotation was computed. [2018-11-10 07:19:42,134 INFO L425 ceAbstractionStarter]: For program point input_allocate_deviceFINAL(lines 3512 3514) no Hoare annotation was computed. [2018-11-10 07:19:42,134 INFO L428 ceAbstractionStarter]: At program point input_allocate_deviceENTRY(lines 3512 3514) the Hoare annotation is: true [2018-11-10 07:19:42,134 INFO L425 ceAbstractionStarter]: For program point input_allocate_deviceEXIT(lines 3512 3514) no Hoare annotation was computed. [2018-11-10 07:19:42,134 INFO L425 ceAbstractionStarter]: For program point L3513(line 3513) no Hoare annotation was computed. [2018-11-10 07:19:42,134 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 07:19:42,134 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (or (= |old(~ldv_urb_state~0)| ~ldv_urb_state~0) (= ~ldv_urb_state~0 0))) [2018-11-10 07:19:42,134 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:19:42,134 INFO L425 ceAbstractionStarter]: For program point interface_to_usbdevFINAL(lines 3437 3444) no Hoare annotation was computed. [2018-11-10 07:19:42,134 INFO L428 ceAbstractionStarter]: At program point interface_to_usbdevENTRY(lines 3437 3444) the Hoare annotation is: true [2018-11-10 07:19:42,134 INFO L425 ceAbstractionStarter]: For program point interface_to_usbdevEXIT(lines 3437 3444) no Hoare annotation was computed. [2018-11-10 07:19:42,134 INFO L421 ceAbstractionStarter]: At program point usb_alloc_urbENTRY(lines 4163 4189) the Hoare annotation is: (or (not (= |usb_alloc_urb_#in~mem_flags| 208)) (not (= |~#kbtab_driver~0.offset| 0)) (not (= |usb_alloc_urb_#in~iso_packets| 0)) (= 0 |#t~string64.base|) (not (= ~res_kbtab_probe_3~0 0)) (= |#t~string66.base| 0) (not (= |#t~string64.offset| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (= ~ldv_urb_state~0 0) (not (= 1 ~ldv_coherent_state~0)) (not (= |#t~string66.offset| 0))) [2018-11-10 07:19:42,135 INFO L425 ceAbstractionStarter]: For program point L4184(lines 4168 4185) no Hoare annotation was computed. [2018-11-10 07:19:42,135 INFO L425 ceAbstractionStarter]: For program point usb_alloc_urbFINAL(lines 4163 4189) no Hoare annotation was computed. [2018-11-10 07:19:42,135 INFO L425 ceAbstractionStarter]: For program point L4175(lines 4175 4179) no Hoare annotation was computed. [2018-11-10 07:19:42,135 INFO L425 ceAbstractionStarter]: For program point L4170(line 4170) no Hoare annotation was computed. [2018-11-10 07:19:42,135 INFO L425 ceAbstractionStarter]: For program point L4169-1(lines 4169 4183) no Hoare annotation was computed. [2018-11-10 07:19:42,135 INFO L421 ceAbstractionStarter]: At program point L4169loopEntry(lines 4169 4183) the Hoare annotation is: (or (not (= |usb_alloc_urb_#in~mem_flags| 208)) (not (= |~#kbtab_driver~0.offset| 0)) (not (= |usb_alloc_urb_#in~iso_packets| 0)) (= 0 |#t~string64.base|) (not (= ~res_kbtab_probe_3~0 0)) (= |#t~string66.base| 0) (not (= |#t~string64.offset| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (= ~ldv_urb_state~0 0) (not (= 1 ~ldv_coherent_state~0)) (not (= |#t~string66.offset| 0))) [2018-11-10 07:19:42,135 INFO L425 ceAbstractionStarter]: For program point usb_alloc_urbEXIT(lines 4163 4189) no Hoare annotation was computed. [2018-11-10 07:19:42,135 INFO L428 ceAbstractionStarter]: At program point ldv_check_final_stateENTRY(lines 4226 4246) the Hoare annotation is: true [2018-11-10 07:19:42,135 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-10 07:19:42,135 INFO L425 ceAbstractionStarter]: For program point L4241-1(lines 4226 4246) no Hoare annotation was computed. [2018-11-10 07:19:42,135 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-10 07:19:42,136 INFO L425 ceAbstractionStarter]: For program point L4234-1(lines 4229 4245) no Hoare annotation was computed. [2018-11-10 07:19:42,136 INFO L425 ceAbstractionStarter]: For program point ldv_check_final_stateEXIT(lines 4226 4246) no Hoare annotation was computed. [2018-11-10 07:19:42,136 INFO L428 ceAbstractionStarter]: At program point usb_registerENTRY(lines 3462 3471) the Hoare annotation is: true [2018-11-10 07:19:42,136 INFO L425 ceAbstractionStarter]: For program point usb_registerEXIT(lines 3462 3471) no Hoare annotation was computed. [2018-11-10 07:19:42,136 INFO L425 ceAbstractionStarter]: For program point usb_registerFINAL(lines 3462 3471) no Hoare annotation was computed. [2018-11-10 07:19:42,136 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:19:42,136 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= |~#__param_str_kb_pressure_click~0.offset| 0) (= |~#kbtab_ids~0.offset| 0) (= ~ldv_coherent_state~0 0) (= |#t~string47.offset| 0) (not (= |#t~string96.base| 0)) (not (= |~#kb_pressure_click~0.base| 0)) (not (= |~#kbtab_ids~0.base| 0)) (= |~#kbtab_driver~0.offset| 0) (not (= |#t~string11.base| 0)) (= |#t~string66.offset| 0) (not (= ~__param_kb_pressure_click~0.name.base 0)) (= |#t~string64.offset| 0) (not (= |#t~string47.base| 0)) (not (= |#t~string48.base| 0)) (= ~LDV_IN_INTERRUPT~0 0) (= |#NULL.base| 0) (= |~#kb_pressure_click~0.offset| 0) (= |#t~string96.offset| 0) (not (= |#t~string17.base| 0)) (= ~__param_kb_pressure_click~0.perm 0) (not (= |~#__param_str_kb_pressure_click~0.base| 0)) (= |#t~string48.offset| 0) (= ~res_kbtab_probe_3~0 0) (= ~__param_kb_pressure_click~0.flags 0) (= 0 ~ldv_urb_state~0) (not (= |#t~string93.base| 0)) (not (= |#t~string66.base| 0)) (not (= |#t~string64.base| 0)) (= |#t~string11.offset| 0) (= |#NULL.offset| 0) (= |#t~string17.offset| 0) (= |#t~string93.offset| 0)) [2018-11-10 07:19:42,136 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 07:19:42,136 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 07:19:42,136 INFO L428 ceAbstractionStarter]: At program point ldv_blast_assertENTRY(lines 4077 4083) the Hoare annotation is: true [2018-11-10 07:19:42,136 INFO L425 ceAbstractionStarter]: For program point ldv_blast_assertEXIT(lines 4077 4083) no Hoare annotation was computed. [2018-11-10 07:19:42,137 INFO L425 ceAbstractionStarter]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4081) no Hoare annotation was computed. [2018-11-10 07:19:42,137 INFO L425 ceAbstractionStarter]: For program point ldv_blast_assertFINAL(lines 4077 4083) no Hoare annotation was computed. [2018-11-10 07:19:42,149 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled [2018-11-10 07:19:42,150 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base [2018-11-10 07:19:42,151 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,151 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,151 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0.name [2018-11-10 07:19:42,152 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!perm [2018-11-10 07:19:42,152 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!flags [2018-11-10 07:19:42,153 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled [2018-11-10 07:19:42,153 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base [2018-11-10 07:19:42,154 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,154 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,155 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0.name [2018-11-10 07:19:42,155 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!perm [2018-11-10 07:19:42,155 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!flags [2018-11-10 07:19:42,157 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled [2018-11-10 07:19:42,157 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base [2018-11-10 07:19:42,158 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,158 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,159 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0.name [2018-11-10 07:19:42,159 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!perm [2018-11-10 07:19:42,159 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!flags [2018-11-10 07:19:42,160 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled [2018-11-10 07:19:42,160 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base [2018-11-10 07:19:42,161 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,161 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,162 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0.name [2018-11-10 07:19:42,162 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!perm [2018-11-10 07:19:42,162 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!flags [2018-11-10 07:19:42,166 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled [2018-11-10 07:19:42,166 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base [2018-11-10 07:19:42,167 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,167 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,168 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0.name [2018-11-10 07:19:42,168 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!perm [2018-11-10 07:19:42,168 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!flags [2018-11-10 07:19:42,169 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled [2018-11-10 07:19:42,169 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base [2018-11-10 07:19:42,170 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,170 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,170 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0.name [2018-11-10 07:19:42,171 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!perm [2018-11-10 07:19:42,171 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!flags [2018-11-10 07:19:42,172 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled [2018-11-10 07:19:42,172 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base [2018-11-10 07:19:42,173 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,173 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,173 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0.name [2018-11-10 07:19:42,173 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!perm [2018-11-10 07:19:42,174 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!flags [2018-11-10 07:19:42,175 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled [2018-11-10 07:19:42,175 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base [2018-11-10 07:19:42,176 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,176 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,176 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0.name [2018-11-10 07:19:42,176 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!perm [2018-11-10 07:19:42,176 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!flags [2018-11-10 07:19:42,188 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled [2018-11-10 07:19:42,188 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base [2018-11-10 07:19:42,188 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,189 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,189 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0.name [2018-11-10 07:19:42,189 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!flags [2018-11-10 07:19:42,189 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!perm [2018-11-10 07:19:42,196 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled [2018-11-10 07:19:42,196 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base [2018-11-10 07:19:42,197 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,197 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,198 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0.name [2018-11-10 07:19:42,198 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!flags [2018-11-10 07:19:42,198 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!perm [2018-11-10 07:19:42,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:19:42 BoogieIcfgContainer [2018-11-10 07:19:42,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 07:19:42,200 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:19:42,200 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:19:42,200 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:19:42,201 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:17:44" (3/4) ... [2018-11-10 07:19:42,203 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 07:19:42,208 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_fill_int_urb [2018-11-10 07:19:42,208 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_init [2018-11-10 07:19:42,208 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_disconnect [2018-11-10 07:19:42,208 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 07:19:42,208 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_get_intfdata [2018-11-10 07:19:42,208 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_exit [2018-11-10 07:19:42,209 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_to_input_id [2018-11-10 07:19:42,209 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2018-11-10 07:19:42,209 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2018-11-10 07:19:42,209 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2018-11-10 07:19:42,209 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_coherent [2018-11-10 07:19:42,209 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_alloc_coherent [2018-11-10 07:19:42,209 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_set_intfdata [2018-11-10 07:19:42,209 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_probe [2018-11-10 07:19:42,209 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure input_set_drvdata [2018-11-10 07:19:42,209 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_make_path [2018-11-10 07:19:42,209 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2018-11-10 07:19:42,209 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __create_pipe [2018-11-10 07:19:42,209 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure input_allocate_device [2018-11-10 07:19:42,209 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 07:19:42,209 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure interface_to_usbdev [2018-11-10 07:19:42,209 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_alloc_urb [2018-11-10 07:19:42,209 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_final_state [2018-11-10 07:19:42,209 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_register [2018-11-10 07:19:42,210 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2018-11-10 07:19:42,232 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 348 nodes and edges [2018-11-10 07:19:42,233 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 173 nodes and edges [2018-11-10 07:19:42,234 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 82 nodes and edges [2018-11-10 07:19:42,235 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-10 07:19:42,263 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((("usb-%s-%s" == 0 || !(\old(res_kbtab_probe_3) == 0)) || !("kbtab" == 0)) || (0 == ldv_urb_state && 0 == ldv_coherent_state)) || !(#NULL == 0)) || !("kbtab" == 0)) || !(kb_pressure_click == 0)) || !("<6>kbtab: v0.0.2:USB KB Gear JamStudio Tablet driver\n" == 0)) || !(#NULL == 0)) || "kbtab" == 0) || "<6>kbtab: v0.0.2:USB KB Gear JamStudio Tablet driver\n" == 0) || 0 == kbtab_ids) || 0 == "kbtab_irq") || !("kbtab_irq" == 0)) || !("KB Gear Tablet" == 0)) || ~__param_kb_pressure_click~0.name == 0) || 0 == "<3>kbtab: %s - usb_submit_urb failed with result %d\n") || !("/input0" == 0)) || !(0 == \old(ldv_urb_state))) || !("usb-%s-%s" == 0)) || 0 == "/input0") || !("<3>kbtab: %s - usb_submit_urb failed with result %d\n" == 0)) || !(0 == __param_str_kb_pressure_click)) || !(kbtab_ids == 0)) || !(\old(ldv_coherent_state) == 0)) || !(\old(LDV_IN_INTERRUPT) == 0)) || "KB Gear Tablet" == 0) || !(0 == unknown-~__param_kb_pressure_click~0!perm-unknown)) || 0 == kb_pressure_click) || !(kbtab_driver == 0)) || !(unknown-~__param_kb_pressure_click~0!flags-unknown == 0)) || 0 == __param_str_kb_pressure_click) || "kbtab" == 0 [2018-11-10 07:19:42,263 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) || ((ldv_s_kbtab_driver_usb_driver == 1 && ldv_urb_state == 1) && ldv_coherent_state == 1)) && 0 == res_kbtab_probe_3) || "usb-%s-%s" == 0) || !(\old(res_kbtab_probe_3) == 0)) || !("kbtab" == 0)) || !(#NULL == 0)) || !("kbtab" == 0)) || !(kb_pressure_click == 0)) || !("<6>kbtab: v0.0.2:USB KB Gear JamStudio Tablet driver\n" == 0)) || !(#NULL == 0)) || "kbtab" == 0) || "<6>kbtab: v0.0.2:USB KB Gear JamStudio Tablet driver\n" == 0) || 0 == kbtab_ids) || 0 == "kbtab_irq") || !("kbtab_irq" == 0)) || !("KB Gear Tablet" == 0)) || ~__param_kb_pressure_click~0.name == 0) || 0 == "<3>kbtab: %s - usb_submit_urb failed with result %d\n") || !("/input0" == 0)) || !(0 == \old(ldv_urb_state))) || !("usb-%s-%s" == 0)) || 0 == "/input0") || !("<3>kbtab: %s - usb_submit_urb failed with result %d\n" == 0)) || !(0 == __param_str_kb_pressure_click)) || !(kbtab_ids == 0)) || !(\old(ldv_coherent_state) == 0)) || !(\old(LDV_IN_INTERRUPT) == 0)) || "KB Gear Tablet" == 0) || !(0 == unknown-~__param_kb_pressure_click~0!perm-unknown)) || 0 == kb_pressure_click) || !(kbtab_driver == 0)) || !(unknown-~__param_kb_pressure_click~0!flags-unknown == 0)) || 0 == __param_str_kb_pressure_click) || "kbtab" == 0 [2018-11-10 07:19:42,263 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((("usb-%s-%s" == 0 || !(\old(res_kbtab_probe_3) == 0)) || !("kbtab" == 0)) || (0 == ldv_urb_state && 0 == ldv_coherent_state)) || !(#NULL == 0)) || !("kbtab" == 0)) || !(kb_pressure_click == 0)) || !("<6>kbtab: v0.0.2:USB KB Gear JamStudio Tablet driver\n" == 0)) || !(#NULL == 0)) || "kbtab" == 0) || "<6>kbtab: v0.0.2:USB KB Gear JamStudio Tablet driver\n" == 0) || 0 == kbtab_ids) || 0 == "kbtab_irq") || !("kbtab_irq" == 0)) || !("KB Gear Tablet" == 0)) || ~__param_kb_pressure_click~0.name == 0) || 0 == "<3>kbtab: %s - usb_submit_urb failed with result %d\n") || !("/input0" == 0)) || !(0 == \old(ldv_urb_state))) || !("usb-%s-%s" == 0)) || 0 == "/input0") || !("<3>kbtab: %s - usb_submit_urb failed with result %d\n" == 0)) || !(0 == __param_str_kb_pressure_click)) || !(kbtab_ids == 0)) || !(\old(ldv_coherent_state) == 0)) || !(\old(LDV_IN_INTERRUPT) == 0)) || "KB Gear Tablet" == 0) || !(0 == unknown-~__param_kb_pressure_click~0!perm-unknown)) || 0 == kb_pressure_click) || !(kbtab_driver == 0)) || !(unknown-~__param_kb_pressure_click~0!flags-unknown == 0)) || 0 == __param_str_kb_pressure_click) || "kbtab" == 0 [2018-11-10 07:19:42,263 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) || !(0 == ldv_urb_state) [2018-11-10 07:19:42,263 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((ldv_urb_state == 0 && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) || !(kbtab_driver == 0)) || 0 == "/input0") || ldv_coherent_state < 1) || !(res_kbtab_probe_3 == 0)) || "KB Gear Tablet" == 0) || !("/input0" == 0)) || !(1 == \old(ldv_urb_state))) || !("KB Gear Tablet" == 0) [2018-11-10 07:19:42,263 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((ldv_urb_state == 0 && !(kbtab == 0)) || (ldv_urb_state == 0 && !(kbtab == 0))) && !(0 == error)) && ldv_coherent_state == 1) || !(kbtab_driver == 0)) || 0 == "/input0") || !(res_kbtab_probe_3 == 0)) || "KB Gear Tablet" == 0) || !("/input0" == 0)) || !(0 == \old(ldv_urb_state))) || !("KB Gear Tablet" == 0)) || !(0 == \old(ldv_coherent_state)) [2018-11-10 07:19:42,264 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(kbtab_driver == 0) || 0 == "/input0") || !(res_kbtab_probe_3 == 0)) || "KB Gear Tablet" == 0) || !("/input0" == 0)) || (((0 < ldv_coherent_state + 1 && ldv_coherent_state <= 0) && ((ldv_urb_state == 0 && !(kbtab == 0)) || (ldv_urb_state == 0 && !(kbtab == 0)))) && !(0 == error)) || ((\old(ldv_coherent_state) == ldv_coherent_state && error + 12 <= 0) && ldv_urb_state == 0)) || !(0 == \old(ldv_urb_state))) || !("KB Gear Tablet" == 0)) || !(0 == \old(ldv_coherent_state)) [2018-11-10 07:19:42,264 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) || ((ldv_s_kbtab_driver_usb_driver == 1 && ldv_urb_state == 1) && ldv_coherent_state == 1)) && 0 == res_kbtab_probe_3) || 0 == "/input0") || "usb-%s-%s" == 0) || !(\old(res_kbtab_probe_3) == 0)) || !("kbtab" == 0)) || !(#NULL == 0)) || !("kbtab" == 0)) || !(kb_pressure_click == 0)) || !("<3>kbtab: %s - usb_submit_urb failed with result %d\n" == 0)) || !("<6>kbtab: v0.0.2:USB KB Gear JamStudio Tablet driver\n" == 0)) || !(#NULL == 0)) || "kbtab" == 0) || "<6>kbtab: v0.0.2:USB KB Gear JamStudio Tablet driver\n" == 0) || !(0 == __param_str_kb_pressure_click)) || 0 == kbtab_ids) || 0 == "kbtab_irq") || !("kbtab_irq" == 0)) || !(\old(LDV_IN_INTERRUPT) == 0)) || "KB Gear Tablet" == 0) || !("KB Gear Tablet" == 0)) || 0 == kb_pressure_click) || !(0 == "usb-%s-%s")) || ~__param_kb_pressure_click~0.name == 0) || 0 == "<3>kbtab: %s - usb_submit_urb failed with result %d\n") || !(kbtab_driver == 0)) || !("/input0" == 0)) || !(unknown-~__param_kb_pressure_click~0!flags-unknown == 0)) || 0 == __param_str_kb_pressure_click) || !(0 == \old(ldv_urb_state))) || !(0 == kbtab_ids)) || "kbtab" == 0) || !(unknown-~__param_kb_pressure_click~0!perm-unknown == 0)) || !(0 == \old(ldv_coherent_state)) [2018-11-10 07:19:42,264 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((("usb-%s-%s" == 0 || !(\old(res_kbtab_probe_3) == 0)) || (((((ldv_s_kbtab_driver_usb_driver == 1 && ldv_urb_state == 1) && !(tmp___8 == 0)) && ldv_coherent_state == 1) || (((ldv_coherent_state == 0 && ldv_urb_state == 0) && !(tmp___8 == 0)) && ldv_s_kbtab_driver_usb_driver == 0)) && 0 == res_kbtab_probe_3)) || !("kbtab" == 0)) || !(#NULL == 0)) || !("kbtab" == 0)) || !(kb_pressure_click == 0)) || !("<6>kbtab: v0.0.2:USB KB Gear JamStudio Tablet driver\n" == 0)) || !(#NULL == 0)) || "kbtab" == 0) || "<6>kbtab: v0.0.2:USB KB Gear JamStudio Tablet driver\n" == 0) || 0 == kbtab_ids) || 0 == "kbtab_irq") || !("kbtab_irq" == 0)) || !("KB Gear Tablet" == 0)) || ~__param_kb_pressure_click~0.name == 0) || 0 == "<3>kbtab: %s - usb_submit_urb failed with result %d\n") || !("/input0" == 0)) || !(0 == \old(ldv_urb_state))) || !("usb-%s-%s" == 0)) || 0 == "/input0") || !("<3>kbtab: %s - usb_submit_urb failed with result %d\n" == 0)) || !(0 == __param_str_kb_pressure_click)) || !(kbtab_ids == 0)) || !(\old(ldv_coherent_state) == 0)) || !(\old(LDV_IN_INTERRUPT) == 0)) || "KB Gear Tablet" == 0) || !(0 == unknown-~__param_kb_pressure_click~0!perm-unknown)) || 0 == kb_pressure_click) || !(kbtab_driver == 0)) || !(unknown-~__param_kb_pressure_click~0!flags-unknown == 0)) || 0 == __param_str_kb_pressure_click) || "kbtab" == 0 [2018-11-10 07:19:42,264 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(ldv_coherent_state) == ldv_coherent_state || \old(ldv_coherent_state) < 1) || !(0 == ldv_urb_state) [2018-11-10 07:19:42,265 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_urb_state == 1 || !(kbtab_driver == 0)) || 0 == "/input0") || ldv_coherent_state < 1) || !(res_kbtab_probe_3 == 0)) || "KB Gear Tablet" == 0) || !("/input0" == 0)) || !(1 == \old(ldv_urb_state))) || !("KB Gear Tablet" == 0) [2018-11-10 07:19:42,265 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_coherent_state == 0 || !(kbtab_driver == 0)) || 0 == "/input0") || !(res_kbtab_probe_3 == 0)) || !(\old(mem_flags) == 208)) || "KB Gear Tablet" == 0) || !("/input0" == 0)) || !(0 == ldv_urb_state)) || !("KB Gear Tablet" == 0)) || !(\old(size) == 8)) || !(0 == \old(ldv_coherent_state)) [2018-11-10 07:19:42,265 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(\old(mem_flags) == 208) || !(kbtab_driver == 0)) || !(\old(iso_packets) == 0)) || 0 == "/input0") || !(res_kbtab_probe_3 == 0)) || "KB Gear Tablet" == 0) || !("/input0" == 0)) || !(0 == \old(ldv_urb_state))) || ldv_urb_state == 0) || !(1 == ldv_coherent_state)) || !("KB Gear Tablet" == 0) [2018-11-10 07:19:42,267 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(kbtab_driver == 0) || 0 == "/input0") || !(res_kbtab_probe_3 == 0)) || "KB Gear Tablet" == 0) || !("/input0" == 0)) || !(0 == \old(ldv_urb_state))) || ((((ldv_urb_state == 1 && !(kbtab == 0)) || (ldv_urb_state == 1 && !(kbtab == 0))) && !(0 == error)) && ldv_coherent_state <= 1 && 1 <= ldv_coherent_state)) || !("KB Gear Tablet" == 0)) || !(0 == \old(ldv_coherent_state)) [2018-11-10 07:19:42,474 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_08c3652c-24a7-4574-a704-0a422826527f/bin-2019/utaipan/witness.graphml [2018-11-10 07:19:42,474 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:19:42,475 INFO L168 Benchmark]: Toolchain (without parser) took 121745.64 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -143.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-11-10 07:19:42,475 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:19:42,475 INFO L168 Benchmark]: CACSL2BoogieTranslator took 978.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 955.0 MB in the beginning and 1.0 GB in the end (delta: -47.7 MB). Peak memory consumption was 179.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:19:42,476 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 996.2 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:19:42,476 INFO L168 Benchmark]: Boogie Preprocessor took 72.04 ms. Allocated memory is still 1.2 GB. Free memory was 996.2 MB in the beginning and 986.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:19:42,476 INFO L168 Benchmark]: RCFGBuilder took 2811.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 986.4 MB in the beginning and 890.0 MB in the end (delta: 96.4 MB). Peak memory consumption was 166.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:19:42,476 INFO L168 Benchmark]: TraceAbstraction took 117536.11 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.4 GB). Free memory was 890.0 MB in the beginning and 1.2 GB in the end (delta: -307.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-11-10 07:19:42,477 INFO L168 Benchmark]: Witness Printer took 274.00 ms. Allocated memory is still 2.7 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 99.3 MB). Peak memory consumption was 99.3 MB. Max. memory is 11.5 GB. [2018-11-10 07:19:42,478 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 978.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 955.0 MB in the beginning and 1.0 GB in the end (delta: -47.7 MB). Peak memory consumption was 179.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 996.2 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.04 ms. Allocated memory is still 1.2 GB. Free memory was 996.2 MB in the beginning and 986.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2811.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 986.4 MB in the beginning and 890.0 MB in the end (delta: 96.4 MB). Peak memory consumption was 166.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 117536.11 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.4 GB). Free memory was 890.0 MB in the beginning and 1.2 GB in the end (delta: -307.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 274.00 ms. Allocated memory is still 2.7 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 99.3 MB). Peak memory consumption was 99.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0.name - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0!perm - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0!flags - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0.name - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0!perm - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0!flags - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0.name - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0!perm - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0!flags - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0.name - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0!perm - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0!flags - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0.name - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0!perm - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0!flags - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0.name - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0!perm - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0!flags - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0.name - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0!perm - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0!flags - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0.name - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0!perm - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0!flags - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0.name - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0!flags - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0!perm - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0.name - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0!flags - GenericResult: Unfinished Backtranslation unknown boogie variable ~__param_kb_pressure_click~0!perm * 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: (((((((((ldv_coherent_state == 0 || !(kbtab_driver == 0)) || 0 == "/input0") || !(res_kbtab_probe_3 == 0)) || !(\old(mem_flags) == 208)) || "KB Gear Tablet" == 0) || !("/input0" == 0)) || !(0 == ldv_urb_state)) || !("KB Gear Tablet" == 0)) || !(\old(size) == 8)) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 4191]: Loop Invariant Derived loop invariant: ((((((((ldv_urb_state == 0 && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) || !(kbtab_driver == 0)) || 0 == "/input0") || ldv_coherent_state < 1) || !(res_kbtab_probe_3 == 0)) || "KB Gear Tablet" == 0) || !("/input0" == 0)) || !(1 == \old(ldv_urb_state))) || !("KB Gear Tablet" == 0) - InvariantResult [Line: 4169]: Loop Invariant Derived loop invariant: (((((((((!(\old(mem_flags) == 208) || !(kbtab_driver == 0)) || !(\old(iso_packets) == 0)) || 0 == "/input0") || !(res_kbtab_probe_3 == 0)) || "KB Gear Tablet" == 0) || !("/input0" == 0)) || !(0 == \old(ldv_urb_state))) || ldv_urb_state == 0) || !(1 == ldv_coherent_state)) || !("KB Gear Tablet" == 0) - InvariantResult [Line: 4005]: Loop Invariant [2018-11-10 07:19:42,481 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled [2018-11-10 07:19:42,482 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base [2018-11-10 07:19:42,482 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,482 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,482 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0.name [2018-11-10 07:19:42,482 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!perm [2018-11-10 07:19:42,483 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!flags [2018-11-10 07:19:42,483 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled [2018-11-10 07:19:42,483 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base [2018-11-10 07:19:42,484 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,484 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,484 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0.name [2018-11-10 07:19:42,484 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!perm [2018-11-10 07:19:42,484 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!flags Derived loop invariant: ((((((((((((((((((((((((((((((("usb-%s-%s" == 0 || !(\old(res_kbtab_probe_3) == 0)) || !("kbtab" == 0)) || (0 == ldv_urb_state && 0 == ldv_coherent_state)) || !(#NULL == 0)) || !("kbtab" == 0)) || !(kb_pressure_click == 0)) || !("<6>kbtab: v0.0.2:USB KB Gear JamStudio Tablet driver\n" == 0)) || !(#NULL == 0)) || "kbtab" == 0) || "<6>kbtab: v0.0.2:USB KB Gear JamStudio Tablet driver\n" == 0) || 0 == kbtab_ids) || 0 == "kbtab_irq") || !("kbtab_irq" == 0)) || !("KB Gear Tablet" == 0)) || ~__param_kb_pressure_click~0.name == 0) || 0 == "<3>kbtab: %s - usb_submit_urb failed with result %d\n") || !("/input0" == 0)) || !(0 == \old(ldv_urb_state))) || !("usb-%s-%s" == 0)) || 0 == "/input0") || !("<3>kbtab: %s - usb_submit_urb failed with result %d\n" == 0)) || !(0 == __param_str_kb_pressure_click)) || !(kbtab_ids == 0)) || !(\old(ldv_coherent_state) == 0)) || !(\old(LDV_IN_INTERRUPT) == 0)) || "KB Gear Tablet" == 0) || !(0 == unknown-~__param_kb_pressure_click~0!perm-unknown)) || 0 == kb_pressure_click) || !(kbtab_driver == 0)) || !(unknown-~__param_kb_pressure_click~0!flags-unknown == 0)) || 0 == __param_str_kb_pressure_click) || "kbtab" == 0 - 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) || !(0 == ldv_urb_state) - InvariantResult [Line: 4006]: Loop Invariant [2018-11-10 07:19:42,485 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled [2018-11-10 07:19:42,485 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base [2018-11-10 07:19:42,486 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,486 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,486 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0.name [2018-11-10 07:19:42,486 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!perm [2018-11-10 07:19:42,487 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!flags [2018-11-10 07:19:42,487 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled [2018-11-10 07:19:42,487 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base [2018-11-10 07:19:42,488 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,488 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,488 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0.name [2018-11-10 07:19:42,488 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!perm [2018-11-10 07:19:42,488 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!flags Derived loop invariant: (((((((((((((((((((((((((((((((((((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) || ((ldv_s_kbtab_driver_usb_driver == 1 && ldv_urb_state == 1) && ldv_coherent_state == 1)) && 0 == res_kbtab_probe_3) || "usb-%s-%s" == 0) || !(\old(res_kbtab_probe_3) == 0)) || !("kbtab" == 0)) || !(#NULL == 0)) || !("kbtab" == 0)) || !(kb_pressure_click == 0)) || !("<6>kbtab: v0.0.2:USB KB Gear JamStudio Tablet driver\n" == 0)) || !(#NULL == 0)) || "kbtab" == 0) || "<6>kbtab: v0.0.2:USB KB Gear JamStudio Tablet driver\n" == 0) || 0 == kbtab_ids) || 0 == "kbtab_irq") || !("kbtab_irq" == 0)) || !("KB Gear Tablet" == 0)) || ~__param_kb_pressure_click~0.name == 0) || 0 == "<3>kbtab: %s - usb_submit_urb failed with result %d\n") || !("/input0" == 0)) || !(0 == \old(ldv_urb_state))) || !("usb-%s-%s" == 0)) || 0 == "/input0") || !("<3>kbtab: %s - usb_submit_urb failed with result %d\n" == 0)) || !(0 == __param_str_kb_pressure_click)) || !(kbtab_ids == 0)) || !(\old(ldv_coherent_state) == 0)) || !(\old(LDV_IN_INTERRUPT) == 0)) || "KB Gear Tablet" == 0) || !(0 == unknown-~__param_kb_pressure_click~0!perm-unknown)) || 0 == kb_pressure_click) || !(kbtab_driver == 0)) || !(unknown-~__param_kb_pressure_click~0!flags-unknown == 0)) || 0 == __param_str_kb_pressure_click) || "kbtab" == 0 - InvariantResult [Line: 3807]: Loop Invariant Derived loop invariant: (((((((!(kbtab_driver == 0) || 0 == "/input0") || !(res_kbtab_probe_3 == 0)) || "KB Gear Tablet" == 0) || !("/input0" == 0)) || (((0 < ldv_coherent_state + 1 && ldv_coherent_state <= 0) && ((ldv_urb_state == 0 && !(kbtab == 0)) || (ldv_urb_state == 0 && !(kbtab == 0)))) && !(0 == error)) || ((\old(ldv_coherent_state) == ldv_coherent_state && error + 12 <= 0) && ldv_urb_state == 0)) || !(0 == \old(ldv_urb_state))) || !("KB Gear Tablet" == 0)) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 4196]: Loop Invariant Derived loop invariant: (((((((ldv_urb_state == 1 || !(kbtab_driver == 0)) || 0 == "/input0") || ldv_coherent_state < 1) || !(res_kbtab_probe_3 == 0)) || "KB Gear Tablet" == 0) || !("/input0" == 0)) || !(1 == \old(ldv_urb_state))) || !("KB Gear Tablet" == 0) - InvariantResult [Line: 4133]: Loop Invariant Derived loop invariant: (\old(ldv_coherent_state) == ldv_coherent_state || \old(ldv_coherent_state) < 1) || !(0 == ldv_urb_state) - InvariantResult [Line: 3993]: Loop Invariant [2018-11-10 07:19:42,490 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled [2018-11-10 07:19:42,490 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base [2018-11-10 07:19:42,490 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,491 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,491 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0.name [2018-11-10 07:19:42,491 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!perm [2018-11-10 07:19:42,491 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!flags [2018-11-10 07:19:42,491 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled [2018-11-10 07:19:42,492 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base [2018-11-10 07:19:42,492 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,492 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,493 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0.name [2018-11-10 07:19:42,493 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!perm [2018-11-10 07:19:42,493 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!flags Derived loop invariant: ((((((((((((((((((((((((((((((("usb-%s-%s" == 0 || !(\old(res_kbtab_probe_3) == 0)) || !("kbtab" == 0)) || (0 == ldv_urb_state && 0 == ldv_coherent_state)) || !(#NULL == 0)) || !("kbtab" == 0)) || !(kb_pressure_click == 0)) || !("<6>kbtab: v0.0.2:USB KB Gear JamStudio Tablet driver\n" == 0)) || !(#NULL == 0)) || "kbtab" == 0) || "<6>kbtab: v0.0.2:USB KB Gear JamStudio Tablet driver\n" == 0) || 0 == kbtab_ids) || 0 == "kbtab_irq") || !("kbtab_irq" == 0)) || !("KB Gear Tablet" == 0)) || ~__param_kb_pressure_click~0.name == 0) || 0 == "<3>kbtab: %s - usb_submit_urb failed with result %d\n") || !("/input0" == 0)) || !(0 == \old(ldv_urb_state))) || !("usb-%s-%s" == 0)) || 0 == "/input0") || !("<3>kbtab: %s - usb_submit_urb failed with result %d\n" == 0)) || !(0 == __param_str_kb_pressure_click)) || !(kbtab_ids == 0)) || !(\old(ldv_coherent_state) == 0)) || !(\old(LDV_IN_INTERRUPT) == 0)) || "KB Gear Tablet" == 0) || !(0 == unknown-~__param_kb_pressure_click~0!perm-unknown)) || 0 == kb_pressure_click) || !(kbtab_driver == 0)) || !(unknown-~__param_kb_pressure_click~0!flags-unknown == 0)) || 0 == __param_str_kb_pressure_click) || "kbtab" == 0 - InvariantResult [Line: 4025]: Loop Invariant [2018-11-10 07:19:42,493 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled [2018-11-10 07:19:42,493 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base [2018-11-10 07:19:42,494 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,494 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,494 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0.name [2018-11-10 07:19:42,495 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!perm [2018-11-10 07:19:42,495 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!flags [2018-11-10 07:19:42,495 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled [2018-11-10 07:19:42,495 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base [2018-11-10 07:19:42,496 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,496 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,496 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0.name [2018-11-10 07:19:42,496 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!perm [2018-11-10 07:19:42,496 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!flags Derived loop invariant: ((((((((((((((((((((((((((((((("usb-%s-%s" == 0 || !(\old(res_kbtab_probe_3) == 0)) || (((((ldv_s_kbtab_driver_usb_driver == 1 && ldv_urb_state == 1) && !(tmp___8 == 0)) && ldv_coherent_state == 1) || (((ldv_coherent_state == 0 && ldv_urb_state == 0) && !(tmp___8 == 0)) && ldv_s_kbtab_driver_usb_driver == 0)) && 0 == res_kbtab_probe_3)) || !("kbtab" == 0)) || !(#NULL == 0)) || !("kbtab" == 0)) || !(kb_pressure_click == 0)) || !("<6>kbtab: v0.0.2:USB KB Gear JamStudio Tablet driver\n" == 0)) || !(#NULL == 0)) || "kbtab" == 0) || "<6>kbtab: v0.0.2:USB KB Gear JamStudio Tablet driver\n" == 0) || 0 == kbtab_ids) || 0 == "kbtab_irq") || !("kbtab_irq" == 0)) || !("KB Gear Tablet" == 0)) || ~__param_kb_pressure_click~0.name == 0) || 0 == "<3>kbtab: %s - usb_submit_urb failed with result %d\n") || !("/input0" == 0)) || !(0 == \old(ldv_urb_state))) || !("usb-%s-%s" == 0)) || 0 == "/input0") || !("<3>kbtab: %s - usb_submit_urb failed with result %d\n" == 0)) || !(0 == __param_str_kb_pressure_click)) || !(kbtab_ids == 0)) || !(\old(ldv_coherent_state) == 0)) || !(\old(LDV_IN_INTERRUPT) == 0)) || "KB Gear Tablet" == 0) || !(0 == unknown-~__param_kb_pressure_click~0!perm-unknown)) || 0 == kb_pressure_click) || !(kbtab_driver == 0)) || !(unknown-~__param_kb_pressure_click~0!flags-unknown == 0)) || 0 == __param_str_kb_pressure_click) || "kbtab" == 0 - InvariantResult [Line: 3807]: Loop Invariant Derived loop invariant: (((((((((((ldv_urb_state == 0 && !(kbtab == 0)) || (ldv_urb_state == 0 && !(kbtab == 0))) && !(0 == error)) && ldv_coherent_state == 1) || !(kbtab_driver == 0)) || 0 == "/input0") || !(res_kbtab_probe_3 == 0)) || "KB Gear Tablet" == 0) || !("/input0" == 0)) || !(0 == \old(ldv_urb_state))) || !("KB Gear Tablet" == 0)) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 3931]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3807]: Loop Invariant Derived loop invariant: (((((((!(kbtab_driver == 0) || 0 == "/input0") || !(res_kbtab_probe_3 == 0)) || "KB Gear Tablet" == 0) || !("/input0" == 0)) || !(0 == \old(ldv_urb_state))) || ((((ldv_urb_state == 1 && !(kbtab == 0)) || (ldv_urb_state == 1 && !(kbtab == 0))) && !(0 == error)) && ldv_coherent_state <= 1 && 1 <= ldv_coherent_state)) || !("KB Gear Tablet" == 0)) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 4022]: Loop Invariant [2018-11-10 07:19:42,498 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled [2018-11-10 07:19:42,498 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base [2018-11-10 07:19:42,498 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,499 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,499 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0.name [2018-11-10 07:19:42,499 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!flags [2018-11-10 07:19:42,499 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!perm [2018-11-10 07:19:42,499 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } } not handled [2018-11-10 07:19:42,500 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__param_kb_pressure_click~0 : { name : $Pointer$, ops : $Pointer$, perm : ~u16~0, flags : ~u16~0, __annonCompField31 : { arg : $Pointer$, str : $Pointer$, arr : $Pointer$ } }; and expression ~__param_kb_pressure_click~0.name.base [2018-11-10 07:19:42,500 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,500 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 07:19:42,500 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0.name [2018-11-10 07:19:42,501 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!flags [2018-11-10 07:19:42,501 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~__param_kb_pressure_click~0!perm Derived loop invariant: (((((((((((((((((((((((((((((((((((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) || ((ldv_s_kbtab_driver_usb_driver == 1 && ldv_urb_state == 1) && ldv_coherent_state == 1)) && 0 == res_kbtab_probe_3) || 0 == "/input0") || "usb-%s-%s" == 0) || !(\old(res_kbtab_probe_3) == 0)) || !("kbtab" == 0)) || !(#NULL == 0)) || !("kbtab" == 0)) || !(kb_pressure_click == 0)) || !("<3>kbtab: %s - usb_submit_urb failed with result %d\n" == 0)) || !("<6>kbtab: v0.0.2:USB KB Gear JamStudio Tablet driver\n" == 0)) || !(#NULL == 0)) || "kbtab" == 0) || "<6>kbtab: v0.0.2:USB KB Gear JamStudio Tablet driver\n" == 0) || !(0 == __param_str_kb_pressure_click)) || 0 == kbtab_ids) || 0 == "kbtab_irq") || !("kbtab_irq" == 0)) || !(\old(LDV_IN_INTERRUPT) == 0)) || "KB Gear Tablet" == 0) || !("KB Gear Tablet" == 0)) || 0 == kb_pressure_click) || !(0 == "usb-%s-%s")) || ~__param_kb_pressure_click~0.name == 0) || 0 == "<3>kbtab: %s - usb_submit_urb failed with result %d\n") || !(kbtab_driver == 0)) || !("/input0" == 0)) || !(unknown-~__param_kb_pressure_click~0!flags-unknown == 0)) || 0 == __param_str_kb_pressure_click) || !(0 == \old(ldv_urb_state))) || !(0 == kbtab_ids)) || "kbtab" == 0) || !(unknown-~__param_kb_pressure_click~0!perm-unknown == 0)) || !(0 == \old(ldv_coherent_state)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 26 procedures, 186 locations, 1 error locations. SAFE Result, 117.4s OverallTime, 18 OverallIterations, 3 TraceHistogramMax, 102.2s AutomataDifference, 0.0s DeadEndRemovalTime, 6.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 3755 SDtfs, 3012 SDslu, 10222 SDs, 0 SdLazy, 6331 SolverSat, 754 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.5s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 451 GetRequests, 244 SyntacticMatches, 2 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3615 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1278occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.947519633548259 AbsIntWeakeningRatio, 4.022875816993464 AbsIntAvgWeakeningVarsNumRemoved, 35.650326797385624 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 449 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 70 LocationsWithAnnotation, 3249 PreInvPairs, 3327 NumberOfFragments, 3530 HoareAnnotationTreeSize, 3249 FomulaSimplifications, 13259 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 70 FomulaSimplificationsInter, 18678 FormulaSimplificationTreeSizeReductionInter, 5.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1846 NumberOfCodeBlocks, 1846 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1828 ConstructedInterpolants, 0 QuantifiedInterpolants, 403164 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 145/159 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...