./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6f929030-376f-4be0-89bb-c87502232e13/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6f929030-376f-4be0-89bb-c87502232e13/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6f929030-376f-4be0-89bb-c87502232e13/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6f929030-376f-4be0-89bb-c87502232e13/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6f929030-376f-4be0-89bb-c87502232e13/bin/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6f929030-376f-4be0-89bb-c87502232e13/bin/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 6b79800b0012dbc4aca68e544b1d0e24c4a91e91 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:25:45,817 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:25:45,821 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:25:45,830 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:25:45,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:25:45,831 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:25:45,832 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:25:45,834 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:25:45,835 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:25:45,836 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:25:45,837 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:25:45,838 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:25:45,838 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:25:45,839 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:25:45,840 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:25:45,841 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:25:45,842 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:25:45,843 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:25:45,844 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:25:45,846 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:25:45,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:25:45,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:25:45,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:25:45,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:25:45,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:25:45,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:25:45,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:25:45,855 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:25:45,855 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:25:45,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:25:45,856 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:25:45,857 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:25:45,857 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:25:45,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:25:45,859 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:25:45,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:25:45,860 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:25:45,860 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:25:45,861 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:25:45,861 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:25:45,862 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:25:45,863 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6f929030-376f-4be0-89bb-c87502232e13/bin/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf [2019-10-22 11:25:45,876 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:25:45,876 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:25:45,879 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:25:45,879 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:25:45,880 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:25:45,880 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:25:45,880 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:25:45,880 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:25:45,880 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:25:45,880 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:25:45,880 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:25:45,881 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:25:45,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:25:45,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:25:45,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:25:45,882 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:25:45,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:25:45,882 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:25:45,882 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:25:45,882 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:25:45,882 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:25:45,882 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:25:45,883 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:25:45,883 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:25:45,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:25:45,883 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:25:45,883 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:25:45,883 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:25:45,884 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:25:45,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:25:45,884 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:25:45,885 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:25:45,885 INFO L138 SettingsManager]: * To the following directory=dump/ [2019-10-22 11:25:45,885 INFO L138 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_6f929030-376f-4be0-89bb-c87502232e13/bin/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 -> 6b79800b0012dbc4aca68e544b1d0e24c4a91e91 [2019-10-22 11:25:45,929 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:25:45,940 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:25:45,943 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:25:45,946 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:25:45,946 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:25:45,947 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6f929030-376f-4be0-89bb-c87502232e13/bin/utaipan/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-10-22 11:25:46,002 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6f929030-376f-4be0-89bb-c87502232e13/bin/utaipan/data/e73cbaf89/fcb20ce3a4af47ef86db3af5e8339563/FLAGa29370485 [2019-10-22 11:25:46,651 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:25:46,654 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6f929030-376f-4be0-89bb-c87502232e13/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-10-22 11:25:46,693 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6f929030-376f-4be0-89bb-c87502232e13/bin/utaipan/data/e73cbaf89/fcb20ce3a4af47ef86db3af5e8339563/FLAGa29370485 [2019-10-22 11:25:46,783 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6f929030-376f-4be0-89bb-c87502232e13/bin/utaipan/data/e73cbaf89/fcb20ce3a4af47ef86db3af5e8339563 [2019-10-22 11:25:46,787 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:25:46,789 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:25:46,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:46,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:25:46,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:25:46,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:46" (1/1) ... [2019-10-22 11:25:46,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c146ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:46, skipping insertion in model container [2019-10-22 11:25:46,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:46" (1/1) ... [2019-10-22 11:25:46,807 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:25:46,893 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:25:47,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:47,825 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:25:48,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:48,075 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:25:48,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:48 WrapperNode [2019-10-22 11:25:48,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:48,076 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:48,077 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:25:48,077 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:25:48,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:48" (1/1) ... [2019-10-22 11:25:48,122 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:48" (1/1) ... [2019-10-22 11:25:48,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:48,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:25:48,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:25:48,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:25:48,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:48" (1/1) ... [2019-10-22 11:25:48,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:48" (1/1) ... [2019-10-22 11:25:48,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:48" (1/1) ... [2019-10-22 11:25:48,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:48" (1/1) ... [2019-10-22 11:25:48,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:48" (1/1) ... [2019-10-22 11:25:48,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:48" (1/1) ... [2019-10-22 11:25:48,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:48" (1/1) ... [2019-10-22 11:25:48,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:25:48,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:25:48,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:25:48,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:25:48,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f929030-376f-4be0-89bb-c87502232e13/bin/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 [2019-10-22 11:25:48,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:25:48,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:25:48,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:25:48,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:25:48,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:25:48,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 11:25:48,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:25:48,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:25:48,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:25:48,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:25:48,806 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:25:49,710 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-22 11:25:49,711 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-22 11:25:49,712 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:25:49,712 INFO L284 CfgBuilder]: Removed 135 assume(true) statements. [2019-10-22 11:25:49,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:49 BoogieIcfgContainer [2019-10-22 11:25:49,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:25:49,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:25:49,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:25:49,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:25:49,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:25:46" (1/3) ... [2019-10-22 11:25:49,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390f02c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:49, skipping insertion in model container [2019-10-22 11:25:49,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:48" (2/3) ... [2019-10-22 11:25:49,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390f02c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:49, skipping insertion in model container [2019-10-22 11:25:49,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:49" (3/3) ... [2019-10-22 11:25:49,723 INFO L109 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-10-22 11:25:49,734 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:25:49,744 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-22 11:25:49,756 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-22 11:25:49,786 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:25:49,786 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:25:49,786 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:25:49,786 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:25:49,786 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:25:49,787 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:25:49,787 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:25:49,787 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:25:49,805 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2019-10-22 11:25:49,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:25:49,812 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:49,813 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:49,815 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:49,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:49,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1802507212, now seen corresponding path program 1 times [2019-10-22 11:25:49,829 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:49,830 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229410598] [2019-10-22 11:25:49,830 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:49,830 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:49,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:50,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:50,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229410598] [2019-10-22 11:25:50,174 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:50,174 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:50,174 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535326268] [2019-10-22 11:25:50,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:50,182 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:50,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:50,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:50,200 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2019-10-22 11:25:50,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:50,283 INFO L93 Difference]: Finished difference Result 345 states and 479 transitions. [2019-10-22 11:25:50,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:50,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-22 11:25:50,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:50,303 INFO L225 Difference]: With dead ends: 345 [2019-10-22 11:25:50,303 INFO L226 Difference]: Without dead ends: 216 [2019-10-22 11:25:50,307 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:50,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-10-22 11:25:50,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 208. [2019-10-22 11:25:50,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-22 11:25:50,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 253 transitions. [2019-10-22 11:25:50,379 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 253 transitions. Word has length 11 [2019-10-22 11:25:50,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:50,379 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 253 transitions. [2019-10-22 11:25:50,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:50,380 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 253 transitions. [2019-10-22 11:25:50,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:25:50,380 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:50,380 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:50,380 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:50,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:50,381 INFO L82 PathProgramCache]: Analyzing trace with hash 43147479, now seen corresponding path program 1 times [2019-10-22 11:25:50,381 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:50,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366929202] [2019-10-22 11:25:50,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:50,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:50,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:50,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366929202] [2019-10-22 11:25:50,512 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:50,512 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:50,512 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856805678] [2019-10-22 11:25:50,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:50,514 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:50,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:50,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:50,515 INFO L87 Difference]: Start difference. First operand 208 states and 253 transitions. Second operand 3 states. [2019-10-22 11:25:50,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:50,617 INFO L93 Difference]: Finished difference Result 600 states and 732 transitions. [2019-10-22 11:25:50,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:50,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-22 11:25:50,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:50,620 INFO L225 Difference]: With dead ends: 600 [2019-10-22 11:25:50,628 INFO L226 Difference]: Without dead ends: 398 [2019-10-22 11:25:50,629 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:50,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-10-22 11:25:50,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 384. [2019-10-22 11:25:50,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-10-22 11:25:50,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 470 transitions. [2019-10-22 11:25:50,686 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 470 transitions. Word has length 12 [2019-10-22 11:25:50,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:50,686 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 470 transitions. [2019-10-22 11:25:50,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:50,686 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 470 transitions. [2019-10-22 11:25:50,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 11:25:50,687 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:50,687 INFO L380 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] [2019-10-22 11:25:50,687 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:50,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:50,688 INFO L82 PathProgramCache]: Analyzing trace with hash 97836559, now seen corresponding path program 1 times [2019-10-22 11:25:50,688 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:50,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284590440] [2019-10-22 11:25:50,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:50,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:50,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:50,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:50,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284590440] [2019-10-22 11:25:50,869 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:50,869 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:25:50,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953853139] [2019-10-22 11:25:50,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:25:50,870 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:50,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:25:50,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:50,871 INFO L87 Difference]: Start difference. First operand 384 states and 470 transitions. Second operand 5 states. [2019-10-22 11:25:50,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:50,995 INFO L93 Difference]: Finished difference Result 882 states and 1112 transitions. [2019-10-22 11:25:50,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:25:50,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-10-22 11:25:50,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:51,000 INFO L225 Difference]: With dead ends: 882 [2019-10-22 11:25:51,001 INFO L226 Difference]: Without dead ends: 505 [2019-10-22 11:25:51,002 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:25:51,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-10-22 11:25:51,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 455. [2019-10-22 11:25:51,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-10-22 11:25:51,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 571 transitions. [2019-10-22 11:25:51,055 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 571 transitions. Word has length 27 [2019-10-22 11:25:51,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:51,056 INFO L462 AbstractCegarLoop]: Abstraction has 455 states and 571 transitions. [2019-10-22 11:25:51,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:25:51,056 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 571 transitions. [2019-10-22 11:25:51,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-22 11:25:51,064 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:51,064 INFO L380 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] [2019-10-22 11:25:51,065 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:51,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:51,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1015401359, now seen corresponding path program 1 times [2019-10-22 11:25:51,065 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:51,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051787043] [2019-10-22 11:25:51,066 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:51,066 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:51,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:51,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:51,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051787043] [2019-10-22 11:25:51,206 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:51,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:25:51,206 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155503145] [2019-10-22 11:25:51,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:51,207 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:51,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:51,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:51,207 INFO L87 Difference]: Start difference. First operand 455 states and 571 transitions. Second operand 4 states. [2019-10-22 11:25:51,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:51,286 INFO L93 Difference]: Finished difference Result 915 states and 1147 transitions. [2019-10-22 11:25:51,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:51,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-10-22 11:25:51,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:51,291 INFO L225 Difference]: With dead ends: 915 [2019-10-22 11:25:51,291 INFO L226 Difference]: Without dead ends: 680 [2019-10-22 11:25:51,292 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:51,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-10-22 11:25:51,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 459. [2019-10-22 11:25:51,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2019-10-22 11:25:51,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 575 transitions. [2019-10-22 11:25:51,347 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 575 transitions. Word has length 43 [2019-10-22 11:25:51,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:51,348 INFO L462 AbstractCegarLoop]: Abstraction has 459 states and 575 transitions. [2019-10-22 11:25:51,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:51,349 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 575 transitions. [2019-10-22 11:25:51,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 11:25:51,351 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:51,352 INFO L380 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] [2019-10-22 11:25:51,353 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:51,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:51,354 INFO L82 PathProgramCache]: Analyzing trace with hash 2036405118, now seen corresponding path program 1 times [2019-10-22 11:25:51,354 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:51,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523910494] [2019-10-22 11:25:51,355 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:51,355 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:51,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:51,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:51,483 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523910494] [2019-10-22 11:25:51,483 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:51,484 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:25:51,484 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617420565] [2019-10-22 11:25:51,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:51,484 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:51,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:51,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:51,485 INFO L87 Difference]: Start difference. First operand 459 states and 575 transitions. Second operand 4 states. [2019-10-22 11:25:51,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:51,554 INFO L93 Difference]: Finished difference Result 961 states and 1206 transitions. [2019-10-22 11:25:51,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:51,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-22 11:25:51,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:51,557 INFO L225 Difference]: With dead ends: 961 [2019-10-22 11:25:51,557 INFO L226 Difference]: Without dead ends: 511 [2019-10-22 11:25:51,558 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:51,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-10-22 11:25:51,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 314. [2019-10-22 11:25:51,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-10-22 11:25:51,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 388 transitions. [2019-10-22 11:25:51,580 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 388 transitions. Word has length 47 [2019-10-22 11:25:51,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:51,580 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 388 transitions. [2019-10-22 11:25:51,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:51,581 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 388 transitions. [2019-10-22 11:25:51,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 11:25:51,582 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:51,582 INFO L380 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] [2019-10-22 11:25:51,582 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:51,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:51,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1015336764, now seen corresponding path program 1 times [2019-10-22 11:25:51,583 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:51,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783578059] [2019-10-22 11:25:51,583 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:51,583 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:51,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:51,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:51,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783578059] [2019-10-22 11:25:51,711 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:51,711 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:51,712 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488097828] [2019-10-22 11:25:51,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:51,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:51,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:51,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:51,715 INFO L87 Difference]: Start difference. First operand 314 states and 388 transitions. Second operand 4 states. [2019-10-22 11:25:51,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:51,808 INFO L93 Difference]: Finished difference Result 554 states and 683 transitions. [2019-10-22 11:25:51,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:51,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-22 11:25:51,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:51,810 INFO L225 Difference]: With dead ends: 554 [2019-10-22 11:25:51,811 INFO L226 Difference]: Without dead ends: 550 [2019-10-22 11:25:51,811 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:51,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-10-22 11:25:51,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 528. [2019-10-22 11:25:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-10-22 11:25:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 660 transitions. [2019-10-22 11:25:51,846 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 660 transitions. Word has length 47 [2019-10-22 11:25:51,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:51,847 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 660 transitions. [2019-10-22 11:25:51,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:51,847 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 660 transitions. [2019-10-22 11:25:51,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-22 11:25:51,848 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:51,849 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:51,849 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:51,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:51,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1949403581, now seen corresponding path program 1 times [2019-10-22 11:25:51,849 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:51,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404104216] [2019-10-22 11:25:51,850 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:51,850 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:51,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:51,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404104216] [2019-10-22 11:25:51,952 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:51,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:25:51,952 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354592300] [2019-10-22 11:25:51,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:25:51,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:51,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:25:51,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:51,953 INFO L87 Difference]: Start difference. First operand 528 states and 660 transitions. Second operand 5 states. [2019-10-22 11:25:52,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:52,078 INFO L93 Difference]: Finished difference Result 1079 states and 1338 transitions. [2019-10-22 11:25:52,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:25:52,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-22 11:25:52,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:52,080 INFO L225 Difference]: With dead ends: 1079 [2019-10-22 11:25:52,081 INFO L226 Difference]: Without dead ends: 553 [2019-10-22 11:25:52,082 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:25:52,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-10-22 11:25:52,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 517. [2019-10-22 11:25:52,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-10-22 11:25:52,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 641 transitions. [2019-10-22 11:25:52,113 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 641 transitions. Word has length 49 [2019-10-22 11:25:52,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:52,113 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 641 transitions. [2019-10-22 11:25:52,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:25:52,113 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 641 transitions. [2019-10-22 11:25:52,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-22 11:25:52,114 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:52,114 INFO L380 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, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:52,115 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:52,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:52,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1249342346, now seen corresponding path program 1 times [2019-10-22 11:25:52,115 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:52,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081938994] [2019-10-22 11:25:52,116 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:52,116 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:52,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:52,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:52,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081938994] [2019-10-22 11:25:52,226 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:52,227 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:52,227 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409208274] [2019-10-22 11:25:52,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:52,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:52,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:52,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:52,228 INFO L87 Difference]: Start difference. First operand 517 states and 641 transitions. Second operand 3 states. [2019-10-22 11:25:52,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:52,292 INFO L93 Difference]: Finished difference Result 1001 states and 1237 transitions. [2019-10-22 11:25:52,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:52,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-22 11:25:52,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:52,295 INFO L225 Difference]: With dead ends: 1001 [2019-10-22 11:25:52,295 INFO L226 Difference]: Without dead ends: 518 [2019-10-22 11:25:52,296 INFO L600 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 [2019-10-22 11:25:52,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-10-22 11:25:52,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 489. [2019-10-22 11:25:52,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-10-22 11:25:52,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 595 transitions. [2019-10-22 11:25:52,332 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 595 transitions. Word has length 54 [2019-10-22 11:25:52,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:52,332 INFO L462 AbstractCegarLoop]: Abstraction has 489 states and 595 transitions. [2019-10-22 11:25:52,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:52,332 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 595 transitions. [2019-10-22 11:25:52,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-22 11:25:52,333 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:52,333 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:52,333 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:52,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:52,334 INFO L82 PathProgramCache]: Analyzing trace with hash 2015730543, now seen corresponding path program 1 times [2019-10-22 11:25:52,334 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:52,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589240464] [2019-10-22 11:25:52,334 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:52,334 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:52,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:52,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:52,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589240464] [2019-10-22 11:25:52,437 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:52,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:25:52,437 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989885394] [2019-10-22 11:25:52,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:52,437 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:52,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:52,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:52,438 INFO L87 Difference]: Start difference. First operand 489 states and 595 transitions. Second operand 4 states. [2019-10-22 11:25:52,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:52,517 INFO L93 Difference]: Finished difference Result 730 states and 883 transitions. [2019-10-22 11:25:52,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:52,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-10-22 11:25:52,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:52,520 INFO L225 Difference]: With dead ends: 730 [2019-10-22 11:25:52,521 INFO L226 Difference]: Without dead ends: 704 [2019-10-22 11:25:52,521 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:52,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-10-22 11:25:52,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 493. [2019-10-22 11:25:52,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-10-22 11:25:52,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 599 transitions. [2019-10-22 11:25:52,566 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 599 transitions. Word has length 56 [2019-10-22 11:25:52,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:52,566 INFO L462 AbstractCegarLoop]: Abstraction has 493 states and 599 transitions. [2019-10-22 11:25:52,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:52,566 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 599 transitions. [2019-10-22 11:25:52,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-22 11:25:52,567 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:52,567 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:52,568 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:52,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:52,570 INFO L82 PathProgramCache]: Analyzing trace with hash -247920110, now seen corresponding path program 1 times [2019-10-22 11:25:52,570 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:52,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511052250] [2019-10-22 11:25:52,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:52,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:52,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:52,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:52,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511052250] [2019-10-22 11:25:52,722 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:52,722 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:25:52,722 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301246318] [2019-10-22 11:25:52,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:25:52,723 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:52,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:25:52,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:52,723 INFO L87 Difference]: Start difference. First operand 493 states and 599 transitions. Second operand 5 states. [2019-10-22 11:25:52,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:52,818 INFO L93 Difference]: Finished difference Result 980 states and 1191 transitions. [2019-10-22 11:25:52,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:25:52,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-10-22 11:25:52,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:52,821 INFO L225 Difference]: With dead ends: 980 [2019-10-22 11:25:52,821 INFO L226 Difference]: Without dead ends: 493 [2019-10-22 11:25:52,822 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:25:52,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-10-22 11:25:52,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2019-10-22 11:25:52,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-10-22 11:25:52,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 598 transitions. [2019-10-22 11:25:52,901 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 598 transitions. Word has length 57 [2019-10-22 11:25:52,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:52,902 INFO L462 AbstractCegarLoop]: Abstraction has 493 states and 598 transitions. [2019-10-22 11:25:52,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:25:52,902 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 598 transitions. [2019-10-22 11:25:52,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-22 11:25:52,902 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:52,903 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:52,903 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:52,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:52,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1290419920, now seen corresponding path program 1 times [2019-10-22 11:25:52,903 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:52,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046257170] [2019-10-22 11:25:52,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:52,905 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:52,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:53,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:53,033 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046257170] [2019-10-22 11:25:53,034 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:53,034 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:53,034 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544393854] [2019-10-22 11:25:53,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:53,034 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:53,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:53,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:53,035 INFO L87 Difference]: Start difference. First operand 493 states and 598 transitions. Second operand 4 states. [2019-10-22 11:25:53,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:53,175 INFO L93 Difference]: Finished difference Result 1329 states and 1625 transitions. [2019-10-22 11:25:53,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:53,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-10-22 11:25:53,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:53,179 INFO L225 Difference]: With dead ends: 1329 [2019-10-22 11:25:53,180 INFO L226 Difference]: Without dead ends: 1041 [2019-10-22 11:25:53,181 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:53,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-10-22 11:25:53,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 844. [2019-10-22 11:25:53,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-10-22 11:25:53,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1035 transitions. [2019-10-22 11:25:53,240 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1035 transitions. Word has length 57 [2019-10-22 11:25:53,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:53,240 INFO L462 AbstractCegarLoop]: Abstraction has 844 states and 1035 transitions. [2019-10-22 11:25:53,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:53,240 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1035 transitions. [2019-10-22 11:25:53,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 11:25:53,241 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:53,241 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:53,241 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:53,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:53,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1563249264, now seen corresponding path program 1 times [2019-10-22 11:25:53,241 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:53,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731922024] [2019-10-22 11:25:53,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:53,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:53,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:53,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:53,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731922024] [2019-10-22 11:25:53,341 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:53,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:25:53,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445975652] [2019-10-22 11:25:53,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:53,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:53,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:53,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:53,342 INFO L87 Difference]: Start difference. First operand 844 states and 1035 transitions. Second operand 4 states. [2019-10-22 11:25:53,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:53,405 INFO L93 Difference]: Finished difference Result 1261 states and 1538 transitions. [2019-10-22 11:25:53,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:53,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-10-22 11:25:53,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:53,407 INFO L225 Difference]: With dead ends: 1261 [2019-10-22 11:25:53,407 INFO L226 Difference]: Without dead ends: 490 [2019-10-22 11:25:53,408 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:53,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-10-22 11:25:53,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 469. [2019-10-22 11:25:53,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-10-22 11:25:53,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 567 transitions. [2019-10-22 11:25:53,441 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 567 transitions. Word has length 63 [2019-10-22 11:25:53,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:53,442 INFO L462 AbstractCegarLoop]: Abstraction has 469 states and 567 transitions. [2019-10-22 11:25:53,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:53,442 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 567 transitions. [2019-10-22 11:25:53,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 11:25:53,443 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:53,443 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:53,443 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:53,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:53,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1703797874, now seen corresponding path program 1 times [2019-10-22 11:25:53,444 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:53,444 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847761777] [2019-10-22 11:25:53,444 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:53,448 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:53,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:53,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:53,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847761777] [2019-10-22 11:25:53,572 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:53,572 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:53,572 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319076553] [2019-10-22 11:25:53,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:53,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:53,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:53,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:53,573 INFO L87 Difference]: Start difference. First operand 469 states and 567 transitions. Second operand 4 states. [2019-10-22 11:25:53,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:53,685 INFO L93 Difference]: Finished difference Result 771 states and 930 transitions. [2019-10-22 11:25:53,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:53,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-10-22 11:25:53,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:53,688 INFO L225 Difference]: With dead ends: 771 [2019-10-22 11:25:53,688 INFO L226 Difference]: Without dead ends: 764 [2019-10-22 11:25:53,689 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:53,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-10-22 11:25:53,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 715. [2019-10-22 11:25:53,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-10-22 11:25:53,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 872 transitions. [2019-10-22 11:25:53,734 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 872 transitions. Word has length 63 [2019-10-22 11:25:53,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:53,735 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 872 transitions. [2019-10-22 11:25:53,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:53,735 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 872 transitions. [2019-10-22 11:25:53,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-22 11:25:53,735 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:53,736 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:53,736 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:53,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:53,736 INFO L82 PathProgramCache]: Analyzing trace with hash 967629456, now seen corresponding path program 1 times [2019-10-22 11:25:53,737 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:53,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939656007] [2019-10-22 11:25:53,737 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:53,737 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:53,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:53,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:53,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939656007] [2019-10-22 11:25:53,818 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:53,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:25:53,818 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777292946] [2019-10-22 11:25:53,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:53,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:53,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:53,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:53,819 INFO L87 Difference]: Start difference. First operand 715 states and 872 transitions. Second operand 4 states. [2019-10-22 11:25:53,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:53,902 INFO L93 Difference]: Finished difference Result 841 states and 1028 transitions. [2019-10-22 11:25:53,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:53,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-10-22 11:25:53,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:53,905 INFO L225 Difference]: With dead ends: 841 [2019-10-22 11:25:53,905 INFO L226 Difference]: Without dead ends: 832 [2019-10-22 11:25:53,906 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:53,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2019-10-22 11:25:53,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 719. [2019-10-22 11:25:53,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-10-22 11:25:53,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 872 transitions. [2019-10-22 11:25:53,959 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 872 transitions. Word has length 64 [2019-10-22 11:25:53,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:53,960 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 872 transitions. [2019-10-22 11:25:53,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:53,960 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 872 transitions. [2019-10-22 11:25:53,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-22 11:25:53,961 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:53,961 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:25:53,961 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:53,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:53,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1689795513, now seen corresponding path program 1 times [2019-10-22 11:25:53,961 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:53,962 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129829841] [2019-10-22 11:25:53,962 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:53,962 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:53,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:54,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:54,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129829841] [2019-10-22 11:25:54,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376872872] [2019-10-22 11:25:54,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f929030-376f-4be0-89bb-c87502232e13/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:25:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:54,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 1065 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 11:25:54,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:25:54,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:54,408 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:25:54,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:54,441 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-22 11:25:54,441 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 5 [2019-10-22 11:25:54,442 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327706923] [2019-10-22 11:25:54,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:54,445 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:54,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:54,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:54,445 INFO L87 Difference]: Start difference. First operand 719 states and 872 transitions. Second operand 4 states. [2019-10-22 11:25:54,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:54,566 INFO L93 Difference]: Finished difference Result 1037 states and 1268 transitions. [2019-10-22 11:25:54,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:54,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-10-22 11:25:54,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:54,567 INFO L225 Difference]: With dead ends: 1037 [2019-10-22 11:25:54,568 INFO L226 Difference]: Without dead ends: 346 [2019-10-22 11:25:54,569 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:54,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-10-22 11:25:54,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 314. [2019-10-22 11:25:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-10-22 11:25:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 357 transitions. [2019-10-22 11:25:54,604 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 357 transitions. Word has length 68 [2019-10-22 11:25:54,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:54,605 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 357 transitions. [2019-10-22 11:25:54,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:54,605 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 357 transitions. [2019-10-22 11:25:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-22 11:25:54,605 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:54,605 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:54,806 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:25:54,806 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:54,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:54,807 INFO L82 PathProgramCache]: Analyzing trace with hash 2027570376, now seen corresponding path program 1 times [2019-10-22 11:25:54,807 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:54,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015499169] [2019-10-22 11:25:54,807 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:54,807 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:54,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:54,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:54,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015499169] [2019-10-22 11:25:54,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:54,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:54,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803395826] [2019-10-22 11:25:54,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:54,933 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:54,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:54,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:54,933 INFO L87 Difference]: Start difference. First operand 314 states and 357 transitions. Second operand 3 states. [2019-10-22 11:25:54,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:54,970 INFO L93 Difference]: Finished difference Result 515 states and 587 transitions. [2019-10-22 11:25:54,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:54,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-22 11:25:54,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:54,972 INFO L225 Difference]: With dead ends: 515 [2019-10-22 11:25:54,972 INFO L226 Difference]: Without dead ends: 242 [2019-10-22 11:25:54,973 INFO L600 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 [2019-10-22 11:25:54,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-10-22 11:25:54,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-10-22 11:25:54,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-10-22 11:25:54,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 268 transitions. [2019-10-22 11:25:54,994 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 268 transitions. Word has length 77 [2019-10-22 11:25:54,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:54,994 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 268 transitions. [2019-10-22 11:25:54,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:54,994 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 268 transitions. [2019-10-22 11:25:54,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-22 11:25:54,995 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:54,995 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:54,995 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:54,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:54,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1039963939, now seen corresponding path program 1 times [2019-10-22 11:25:54,995 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:54,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950172992] [2019-10-22 11:25:54,996 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:54,996 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:54,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:55,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:55,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950172992] [2019-10-22 11:25:55,337 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:55,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:55,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426263988] [2019-10-22 11:25:55,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:55,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:55,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:55,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:55,338 INFO L87 Difference]: Start difference. First operand 242 states and 268 transitions. Second operand 4 states. [2019-10-22 11:25:55,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:55,417 INFO L93 Difference]: Finished difference Result 244 states and 269 transitions. [2019-10-22 11:25:55,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:55,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-10-22 11:25:55,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:55,419 INFO L225 Difference]: With dead ends: 244 [2019-10-22 11:25:55,419 INFO L226 Difference]: Without dead ends: 211 [2019-10-22 11:25:55,419 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:55,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-22 11:25:55,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 132. [2019-10-22 11:25:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-22 11:25:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2019-10-22 11:25:55,435 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 79 [2019-10-22 11:25:55,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:55,435 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2019-10-22 11:25:55,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:55,435 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2019-10-22 11:25:55,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-22 11:25:55,436 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:55,436 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:55,436 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:55,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:55,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1761187395, now seen corresponding path program 1 times [2019-10-22 11:25:55,437 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:55,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212584147] [2019-10-22 11:25:55,437 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:55,437 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:55,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:55,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212584147] [2019-10-22 11:25:55,548 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:55,548 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:25:55,548 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644151726] [2019-10-22 11:25:55,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:25:55,549 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:55,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:25:55,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:55,550 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand 5 states. [2019-10-22 11:25:55,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:55,634 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2019-10-22 11:25:55,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:25:55,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-10-22 11:25:55,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:55,634 INFO L225 Difference]: With dead ends: 132 [2019-10-22 11:25:55,634 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:25:55,635 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:25:55,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:25:55,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:25:55,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:25:55,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:25:55,636 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2019-10-22 11:25:55,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:55,636 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:25:55,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:25:55,636 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:25:55,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:25:55,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:25:56,246 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 26 [2019-10-22 11:25:56,450 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2019-10-22 11:25:56,856 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 40 [2019-10-22 11:25:57,442 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2019-10-22 11:25:57,654 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 41 [2019-10-22 11:25:57,819 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2019-10-22 11:25:58,130 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 41 [2019-10-22 11:25:58,465 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 49 [2019-10-22 11:25:58,729 INFO L443 ceAbstractionStarter]: For program point L3801(lines 3801 3804) no Hoare annotation was computed. [2019-10-22 11:25:58,730 INFO L439 ceAbstractionStarter]: At program point L4231(lines 4230 4232) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,730 INFO L443 ceAbstractionStarter]: For program point L4066(lines 4066 4069) no Hoare annotation was computed. [2019-10-22 11:25:58,730 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 4037) no Hoare annotation was computed. [2019-10-22 11:25:58,731 INFO L443 ceAbstractionStarter]: For program point L4034(lines 1 4254) no Hoare annotation was computed. [2019-10-22 11:25:58,731 INFO L443 ceAbstractionStarter]: For program point L4034-2(lines 1 4254) no Hoare annotation was computed. [2019-10-22 11:25:58,731 INFO L443 ceAbstractionStarter]: For program point L4034-1(lines 1 4254) no Hoare annotation was computed. [2019-10-22 11:25:58,731 INFO L443 ceAbstractionStarter]: For program point L4034-4(lines 4178 4183) no Hoare annotation was computed. [2019-10-22 11:25:58,731 INFO L443 ceAbstractionStarter]: For program point L4034-3(lines 1 4254) no Hoare annotation was computed. [2019-10-22 11:25:58,731 INFO L439 ceAbstractionStarter]: At program point L4034-5(lines 4169 4186) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2019-10-22 11:25:58,731 INFO L439 ceAbstractionStarter]: At program point L4134(lines 4112 4136) the Hoare annotation is: (let ((.cse0 (<= ~ldv_coherent_state~0 1)) (.cse1 (<= 1 ~ldv_coherent_state~0)) (.cse2 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0)) (.cse4 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse5 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 (= ~ldv_urb_state~0 0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (<= ~ldv_urb_state~0 1) (or (not .cse2) (not .cse3)) .cse4 (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) .cse5))) [2019-10-22 11:25:58,731 INFO L443 ceAbstractionStarter]: For program point L3969(line 3969) no Hoare annotation was computed. [2019-10-22 11:25:58,731 INFO L443 ceAbstractionStarter]: For program point L3903(lines 3903 3906) no Hoare annotation was computed. [2019-10-22 11:25:58,732 INFO L439 ceAbstractionStarter]: At program point L4234(lines 4172 4177) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:25:58,732 INFO L443 ceAbstractionStarter]: For program point L3475(lines 3475 3482) no Hoare annotation was computed. [2019-10-22 11:25:58,732 INFO L443 ceAbstractionStarter]: For program point L4037-1(line 4037) no Hoare annotation was computed. [2019-10-22 11:25:58,732 INFO L443 ceAbstractionStarter]: For program point L4037(line 4037) no Hoare annotation was computed. [2019-10-22 11:25:58,732 INFO L443 ceAbstractionStarter]: For program point L4037-3(line 4037) no Hoare annotation was computed. [2019-10-22 11:25:58,732 INFO L443 ceAbstractionStarter]: For program point L4037-2(line 4037) no Hoare annotation was computed. [2019-10-22 11:25:58,732 INFO L443 ceAbstractionStarter]: For program point L4037-5(line 4037) no Hoare annotation was computed. [2019-10-22 11:25:58,732 INFO L443 ceAbstractionStarter]: For program point L4037-4(line 4037) no Hoare annotation was computed. [2019-10-22 11:25:58,732 INFO L443 ceAbstractionStarter]: For program point L3839(lines 3839 3842) no Hoare annotation was computed. [2019-10-22 11:25:58,733 INFO L439 ceAbstractionStarter]: At program point L4203(lines 4202 4204) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse0 (= 0 ~ldv_coherent_state~0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (and (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (and .cse1 .cse2))) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (let ((.cse4 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse3 (div .cse4 18446744073709551616))) (or (< (* 18446744073709551616 .cse3) .cse4) (<= (+ .cse3 1) 0)))) (and (let ((.cse6 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse5 (div .cse6 18446744073709551616))) (or (<= (+ .cse5 1) 0) (< (* 18446744073709551616 .cse5) .cse6)))) .cse2) .cse0 .cse1 (= 0 ~res_kbtab_probe_3~0)))) [2019-10-22 11:25:58,733 INFO L439 ceAbstractionStarter]: At program point L3840(lines 3781 3861) the Hoare annotation is: (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,733 INFO L443 ceAbstractionStarter]: For program point L3444(lines 3444 3448) no Hoare annotation was computed. [2019-10-22 11:25:58,733 INFO L443 ceAbstractionStarter]: For program point L3444-2(lines 3444 3448) no Hoare annotation was computed. [2019-10-22 11:25:58,733 INFO L439 ceAbstractionStarter]: At program point L4105-1(lines 4081 4110) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (let ((.cse1 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (< (* 18446744073709551616 .cse0) .cse1)))) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (let ((.cse3 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse2 (div .cse3 18446744073709551616))) (or (< (* 18446744073709551616 .cse2) .cse3) (<= (+ .cse2 1) 0)))) (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-10-22 11:25:58,733 INFO L439 ceAbstractionStarter]: At program point L4105(lines 4081 4110) the Hoare annotation is: (let ((.cse0 (let ((.cse7 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse6 (div .cse7 18446744073709551616))) (or (<= (+ .cse6 1) 0) (< (* 18446744073709551616 .cse6) .cse7))))) (.cse1 (= 0 ~ldv_coherent_state~0)) (.cse2 (= ~ldv_urb_state~0 0)) (.cse3 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse3) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) .cse0 (let ((.cse5 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse4 (div .cse5 18446744073709551616))) (or (< (* 18446744073709551616 .cse4) .cse5) (<= (+ .cse4 1) 0)))) .cse1 .cse2 (= 0 ~res_kbtab_probe_3~0) .cse3))) [2019-10-22 11:25:58,733 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 4037) no Hoare annotation was computed. [2019-10-22 11:25:58,734 INFO L443 ceAbstractionStarter]: For program point L3973(lines 3973 3978) no Hoare annotation was computed. [2019-10-22 11:25:58,734 INFO L443 ceAbstractionStarter]: For program point L3808(lines 3808 3811) no Hoare annotation was computed. [2019-10-22 11:25:58,734 INFO L443 ceAbstractionStarter]: For program point L3478(lines 3478 3482) no Hoare annotation was computed. [2019-10-22 11:25:58,734 INFO L443 ceAbstractionStarter]: For program point L3478-2(lines 3475 3482) no Hoare annotation was computed. [2019-10-22 11:25:58,734 INFO L443 ceAbstractionStarter]: For program point L4074(lines 4059 4075) no Hoare annotation was computed. [2019-10-22 11:25:58,734 INFO L443 ceAbstractionStarter]: For program point L3975-1(lines 3973 3978) no Hoare annotation was computed. [2019-10-22 11:25:58,734 INFO L443 ceAbstractionStarter]: For program point L3975(lines 3975 3978) no Hoare annotation was computed. [2019-10-22 11:25:58,734 INFO L439 ceAbstractionStarter]: At program point L4207(lines 4206 4208) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,734 INFO L439 ceAbstractionStarter]: At program point L3910(lines 3899 3912) the Hoare annotation is: (let ((.cse0 (= 0 ~ldv_coherent_state~0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= 0 ~res_kbtab_probe_3~0)) (and (or (<= (+ ULTIMATE.start_kbtab_init_~retval~1 1) 0) (< 0 ULTIMATE.start_kbtab_init_~retval~1)) .cse0 .cse1))) [2019-10-22 11:25:58,734 INFO L439 ceAbstractionStarter]: At program point L4241(lines 4240 4242) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-10-22 11:25:58,735 INFO L439 ceAbstractionStarter]: At program point L4142loopEntry(lines 4142 4161) the Hoare annotation is: (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,735 INFO L439 ceAbstractionStarter]: At program point L4142-2loopEntry(lines 4142 4161) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0)) [2019-10-22 11:25:58,735 INFO L439 ceAbstractionStarter]: At program point L3911(lines 3897 3913) the Hoare annotation is: (let ((.cse0 (= 0 ~ldv_coherent_state~0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= 0 ~res_kbtab_probe_3~0)) (and (or (<= (+ ULTIMATE.start_kbtab_init_~retval~1 1) 0) (< 0 ULTIMATE.start_kbtab_init_~retval~1)) (or (<= 1 |ULTIMATE.start_kbtab_init_#res|) (<= (+ |ULTIMATE.start_kbtab_init_#res| 1) 0)) .cse0 .cse1))) [2019-10-22 11:25:58,735 INFO L439 ceAbstractionStarter]: At program point L3416(lines 3410 3418) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0)) [2019-10-22 11:25:58,735 INFO L439 ceAbstractionStarter]: At program point L3449(lines 3437 3451) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,735 INFO L443 ceAbstractionStarter]: For program point L4143-1(lines 4142 4161) no Hoare annotation was computed. [2019-10-22 11:25:58,735 INFO L443 ceAbstractionStarter]: For program point L4143(lines 4142 4161) no Hoare annotation was computed. [2019-10-22 11:25:58,736 INFO L439 ceAbstractionStarter]: At program point L4077(lines 4054 4079) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_usb_alloc_coherent_#res.base| 0)) (.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse2 (= 0 |ULTIMATE.start_usb_alloc_coherent_#res.offset|)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) .cse0 .cse1 (= 0 ~res_kbtab_probe_3~0) (or (not .cse2) (not .cse3)) .cse4) (and (= 0 ~ldv_coherent_state~0) .cse3 .cse0 .cse1 .cse2 .cse4))) [2019-10-22 11:25:58,736 INFO L439 ceAbstractionStarter]: At program point L4210(lines 4209 4211) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,736 INFO L443 ceAbstractionStarter]: For program point L4144(lines 4142 4161) no Hoare annotation was computed. [2019-10-22 11:25:58,737 INFO L439 ceAbstractionStarter]: At program point L4210-1(lines 4209 4211) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,737 INFO L439 ceAbstractionStarter]: At program point L4210-2(lines 4209 4211) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,737 INFO L443 ceAbstractionStarter]: For program point L4144-1(lines 4142 4161) no Hoare annotation was computed. [2019-10-22 11:25:58,737 INFO L439 ceAbstractionStarter]: At program point L3484(lines 3463 3486) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,738 INFO L446 ceAbstractionStarter]: At program point L4046(lines 4046 4047) the Hoare annotation is: true [2019-10-22 11:25:58,738 INFO L446 ceAbstractionStarter]: At program point L4046-2(lines 4046 4047) the Hoare annotation is: true [2019-10-22 11:25:58,738 INFO L446 ceAbstractionStarter]: At program point L4046-1(lines 4046 4047) the Hoare annotation is: true [2019-10-22 11:25:58,738 INFO L446 ceAbstractionStarter]: At program point L4046-3(lines 4046 4047) the Hoare annotation is: true [2019-10-22 11:25:58,738 INFO L439 ceAbstractionStarter]: At program point L3519(lines 3513 3521) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,738 INFO L439 ceAbstractionStarter]: At program point L4213(lines 4212 4214) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0)) [2019-10-22 11:25:58,738 INFO L443 ceAbstractionStarter]: For program point L3982(lines 3982 4018) no Hoare annotation was computed. [2019-10-22 11:25:58,738 INFO L439 ceAbstractionStarter]: At program point L4016(lines 3968 4019) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_kbtab_probe_#res| 0)) (.cse2 (<= 1 ~ldv_coherent_state~0)) (.cse4 (<= 1 ~ldv_urb_state~0)) (.cse1 (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (.cse5 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 1))) (.cse3 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) .cse3 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (and .cse0 (<= ~ldv_coherent_state~0 1) .cse1 .cse2 (<= ~ldv_urb_state~0 1) .cse3 .cse4) (and .cse1 (and (and (let ((.cse7 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse6 (div .cse7 18446744073709551616))) (or (<= (+ .cse6 1) 0) (< (* 18446744073709551616 .cse6) .cse7)))) .cse5) .cse3)))) [2019-10-22 11:25:58,739 INFO L439 ceAbstractionStarter]: At program point L3983(lines 3982 4018) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_kbtab_probe_#res| 0)) (.cse2 (<= 1 ~ldv_coherent_state~0)) (.cse4 (<= 1 ~ldv_urb_state~0)) (.cse1 (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (.cse5 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 1))) (.cse3 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) .cse3 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (and .cse0 (<= ~ldv_coherent_state~0 1) .cse1 .cse2 (<= ~ldv_urb_state~0 1) .cse3 .cse4) (and .cse1 (and (and (let ((.cse7 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse6 (div .cse7 18446744073709551616))) (or (<= (+ .cse6 1) 0) (< (* 18446744073709551616 .cse6) .cse7)))) .cse5) .cse3)))) [2019-10-22 11:25:58,739 INFO L439 ceAbstractionStarter]: At program point L3851(lines 3781 3861) the Hoare annotation is: (let ((.cse0 (<= ~ldv_coherent_state~0 1)) (.cse1 (<= 1 ~ldv_coherent_state~0)) (.cse2 (= ~ldv_urb_state~0 0)) (.cse3 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse3) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) .cse0 .cse1 (let ((.cse5 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse4 (div .cse5 18446744073709551616))) (or (< (* 18446744073709551616 .cse4) .cse5) (<= (+ .cse4 1) 0)))) .cse2 (= 0 ~res_kbtab_probe_3~0) .cse3))) [2019-10-22 11:25:58,739 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:25:58,739 INFO L439 ceAbstractionStarter]: At program point L3390(lines 3383 3392) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,739 INFO L439 ceAbstractionStarter]: At program point L3390-1(lines 3383 3392) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,739 INFO L439 ceAbstractionStarter]: At program point L4249-2(lines 4248 4250) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,739 INFO L439 ceAbstractionStarter]: At program point L4249-3(lines 4248 4250) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,740 INFO L439 ceAbstractionStarter]: At program point L4249(lines 4248 4250) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,740 INFO L439 ceAbstractionStarter]: At program point L4249-1(lines 4248 4250) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,740 INFO L439 ceAbstractionStarter]: At program point L4216(lines 3996 3999) the Hoare annotation is: (let ((.cse1 (= 0 ~res_kbtab_probe_3~0)) (.cse0 (= |ULTIMATE.start_kbtab_probe_#res| 0))) (let ((.cse4 (not .cse0)) (.cse5 (not .cse1)) (.cse2 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse3 (= 0 ~ldv_coherent_state~0)) (.cse6 (= ~ldv_urb_state~0 0))) (or (and .cse0 (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) .cse1 (<= 1 ~ldv_urb_state~0) .cse2) (and .cse3 (and .cse4 .cse5 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (and .cse6 .cse2))) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) .cse4 .cse5 (let ((.cse8 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse7 (div .cse8 18446744073709551616))) (or (< (* 18446744073709551616 .cse7) .cse8) (<= (+ .cse7 1) 0)))) (and (let ((.cse10 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse9 (div .cse10 18446744073709551616))) (or (<= (+ .cse9 1) 0) (< (* 18446744073709551616 .cse9) .cse10)))) .cse2) .cse3 .cse6)))) [2019-10-22 11:25:58,741 INFO L439 ceAbstractionStarter]: At program point L4117loopEntry(lines 4117 4130) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,741 INFO L439 ceAbstractionStarter]: At program point L4249-4(lines 4248 4250) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0)) [2019-10-22 11:25:58,741 INFO L443 ceAbstractionStarter]: For program point L3985(lines 3985 4018) no Hoare annotation was computed. [2019-10-22 11:25:58,741 INFO L443 ceAbstractionStarter]: For program point L4118(line 4118) no Hoare annotation was computed. [2019-10-22 11:25:58,741 INFO L443 ceAbstractionStarter]: For program point L4151(lines 4151 4156) no Hoare annotation was computed. [2019-10-22 11:25:58,741 INFO L439 ceAbstractionStarter]: At program point L4085loopEntry(lines 4085 4104) the Hoare annotation is: (let ((.cse0 (<= ~ldv_coherent_state~0 1)) (.cse1 (<= 1 ~ldv_coherent_state~0)) (.cse2 (= ~ldv_urb_state~0 0)) (.cse3 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse3) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) .cse0 .cse1 (let ((.cse5 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse4 (div .cse5 18446744073709551616))) (or (< (* 18446744073709551616 .cse4) .cse5) (<= (+ .cse4 1) 0)))) .cse2 (= 0 ~res_kbtab_probe_3~0) .cse3))) [2019-10-22 11:25:58,741 INFO L443 ceAbstractionStarter]: For program point L4151-2(lines 4151 4156) no Hoare annotation was computed. [2019-10-22 11:25:58,742 INFO L439 ceAbstractionStarter]: At program point L3986(lines 3985 4018) the Hoare annotation is: (let ((.cse3 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 1))) (.cse4 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 ULTIMATE.start_main_~tmp___8~3))) (.cse6 (= |ULTIMATE.start_kbtab_probe_#res| 0)) (.cse0 (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (.cse7 (<= 1 ~ldv_coherent_state~0)) (.cse5 (= 0 ~res_kbtab_probe_3~0)) (.cse8 (<= 1 ~ldv_urb_state~0))) (or (and .cse0 (and (and (let ((.cse2 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse1 (div .cse2 18446744073709551616))) (or (<= (+ .cse1 1) 0) (< (* 18446744073709551616 .cse1) .cse2)))) .cse3 .cse4) .cse5)) (and .cse6 .cse0 .cse5 (and .cse3 .cse7 .cse4) .cse8) (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) .cse5 .cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (and .cse6 (<= ~ldv_coherent_state~0 1) .cse0 .cse7 (<= ~ldv_urb_state~0 1) .cse5 .cse8))) [2019-10-22 11:25:58,742 INFO L439 ceAbstractionStarter]: At program point L4085-2loopEntry(lines 4085 4104) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (< (* 18446744073709551616 .cse0) .cse1) (<= (+ .cse0 1) 0)))) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-10-22 11:25:58,742 INFO L443 ceAbstractionStarter]: For program point L4086(lines 4085 4104) no Hoare annotation was computed. [2019-10-22 11:25:58,742 INFO L439 ceAbstractionStarter]: At program point L4020(lines 3967 4021) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:25:58,742 INFO L443 ceAbstractionStarter]: For program point L4086-1(lines 4085 4104) no Hoare annotation was computed. [2019-10-22 11:25:58,742 INFO L439 ceAbstractionStarter]: At program point L3855(lines 3781 3861) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse0 (= 0 ~ldv_coherent_state~0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (and (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (and .cse1 .cse2))) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (let ((.cse4 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse3 (div .cse4 18446744073709551616))) (or (< (* 18446744073709551616 .cse3) .cse4) (<= (+ .cse3 1) 0)))) (and (let ((.cse6 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse5 (div .cse6 18446744073709551616))) (or (<= (+ .cse5 1) 0) (< (* 18446744073709551616 .cse5) .cse6)))) .cse2) .cse0 .cse1 (= 0 ~res_kbtab_probe_3~0)))) [2019-10-22 11:25:58,742 INFO L439 ceAbstractionStarter]: At program point L3459(lines 3453 3461) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-10-22 11:25:58,743 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4037) no Hoare annotation was computed. [2019-10-22 11:25:58,743 INFO L439 ceAbstractionStarter]: At program point L4219(lines 4218 4220) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-10-22 11:25:58,743 INFO L439 ceAbstractionStarter]: At program point L4252-1(lines 1 4254) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (let ((.cse1 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (< (* 18446744073709551616 .cse0) .cse1)))) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (let ((.cse3 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse2 (div .cse3 18446744073709551616))) (or (< (* 18446744073709551616 .cse2) .cse3) (<= (+ .cse2 1) 0)))) (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-10-22 11:25:58,743 INFO L443 ceAbstractionStarter]: For program point L4252(lines 4252 4254) no Hoare annotation was computed. [2019-10-22 11:25:58,743 INFO L443 ceAbstractionStarter]: For program point L4087-1(lines 4085 4104) no Hoare annotation was computed. [2019-10-22 11:25:58,743 INFO L443 ceAbstractionStarter]: For program point L4087(lines 4085 4104) no Hoare annotation was computed. [2019-10-22 11:25:58,743 INFO L443 ceAbstractionStarter]: For program point L3790(lines 3790 3796) no Hoare annotation was computed. [2019-10-22 11:25:58,743 INFO L439 ceAbstractionStarter]: At program point L3427-1(lines 3421 3429) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0)) [2019-10-22 11:25:58,744 INFO L439 ceAbstractionStarter]: At program point L3427(lines 3421 3429) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,744 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:25:58,744 INFO L439 ceAbstractionStarter]: At program point L4189-1(lines 4188 4190) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,744 INFO L439 ceAbstractionStarter]: At program point L4189(lines 4188 4190) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,745 INFO L443 ceAbstractionStarter]: For program point L4123(lines 4123 4126) no Hoare annotation was computed. [2019-10-22 11:25:58,745 INFO L443 ceAbstractionStarter]: For program point L3793(lines 3793 3796) no Hoare annotation was computed. [2019-10-22 11:25:58,745 INFO L439 ceAbstractionStarter]: At program point L4223(lines 4222 4224) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,745 INFO L439 ceAbstractionStarter]: At program point L4223-1(lines 4222 4224) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,745 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:25:58,745 INFO L439 ceAbstractionStarter]: At program point L3860(lines 3770 3862) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_kbtab_probe_#res| 0))) (let ((.cse0 (not .cse4)) (.cse2 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse3 (= 0 ~ldv_coherent_state~0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse5 (= 0 ~res_kbtab_probe_3~0))) (or (and (and .cse0 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (and .cse1 .cse2)) .cse3) (and .cse4 (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) .cse5 (<= 1 ~ldv_urb_state~0) .cse2) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) .cse0 (let ((.cse7 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse6 (div .cse7 18446744073709551616))) (or (< (* 18446744073709551616 .cse6) .cse7) (<= (+ .cse6 1) 0)))) (and (let ((.cse9 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse8 (div .cse9 18446744073709551616))) (or (<= (+ .cse8 1) 0) (< (* 18446744073709551616 .cse8) .cse9)))) .cse2) .cse3 .cse1 .cse5)))) [2019-10-22 11:25:58,745 INFO L439 ceAbstractionStarter]: At program point L3497(lines 3494 3499) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,746 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4037) no Hoare annotation was computed. [2019-10-22 11:25:58,746 INFO L439 ceAbstractionStarter]: At program point L3564(lines 3557 3566) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,746 INFO L439 ceAbstractionStarter]: At program point L3399-1(lines 3393 3401) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,746 INFO L439 ceAbstractionStarter]: At program point L3399(lines 3393 3401) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,746 INFO L439 ceAbstractionStarter]: At program point L4060loopEntry(lines 4060 4073) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,746 INFO L439 ceAbstractionStarter]: At program point L4193(lines 4192 4194) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0)) [2019-10-22 11:25:58,746 INFO L443 ceAbstractionStarter]: For program point L4094(lines 4094 4099) no Hoare annotation was computed. [2019-10-22 11:25:58,746 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4037) no Hoare annotation was computed. [2019-10-22 11:25:58,747 INFO L443 ceAbstractionStarter]: For program point L4094-2(lines 4094 4099) no Hoare annotation was computed. [2019-10-22 11:25:58,747 INFO L443 ceAbstractionStarter]: For program point L4061(line 4061) no Hoare annotation was computed. [2019-10-22 11:25:58,747 INFO L443 ceAbstractionStarter]: For program point L3962(lines 3962 3965) no Hoare annotation was computed. [2019-10-22 11:25:58,747 INFO L439 ceAbstractionStarter]: At program point L3434(lines 3430 3436) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,747 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:25:58,747 INFO L439 ceAbstractionStarter]: At program point L3501(lines 3500 3502) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,747 INFO L439 ceAbstractionStarter]: At program point L4162(lines 4138 4167) the Hoare annotation is: (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (< (* 18446744073709551616 .cse0) .cse1) (<= (+ .cse0 1) 0)))) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,747 INFO L439 ceAbstractionStarter]: At program point L4162-1(lines 4138 4167) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (< (* 18446744073709551616 .cse0) .cse1) (<= (+ .cse0 1) 0)))) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-10-22 11:25:58,747 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4037) no Hoare annotation was computed. [2019-10-22 11:25:58,748 INFO L439 ceAbstractionStarter]: At program point L4031(lines 3949 4033) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2019-10-22 11:25:58,748 INFO L439 ceAbstractionStarter]: At program point L4197-1(lines 4196 4198) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,748 INFO L439 ceAbstractionStarter]: At program point L4197(lines 4196 4198) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-10-22 11:25:58,749 INFO L443 ceAbstractionStarter]: For program point L4131(lines 4116 4132) no Hoare annotation was computed. [2019-10-22 11:25:58,749 INFO L439 ceAbstractionStarter]: At program point L4197-2(lines 4196 4198) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0)) [2019-10-22 11:25:58,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:25:58 BoogieIcfgContainer [2019-10-22 11:25:58,796 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:25:58,796 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:25:58,796 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:25:58,797 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:25:58,797 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:49" (3/4) ... [2019-10-22 11:25:58,801 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:25:58,819 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 63 nodes and edges [2019-10-22 11:25:58,820 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2019-10-22 11:25:58,821 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-10-22 11:25:58,822 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-10-22 11:25:58,852 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) || ((((retval + 1 <= 0 || 0 < retval) && (1 <= \result || \result + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) [2019-10-22 11:25:58,852 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 0 && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && !(ldv_s_kbtab_driver_usb_driver == 1)) || (((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0)) || ((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state)) || (1 <= ldv_s_kbtab_driver_usb_driver && (((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 0 == res_kbtab_probe_3) [2019-10-22 11:25:58,853 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 0 && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && !(ldv_s_kbtab_driver_usb_driver == 1)) || (((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0)) || ((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state)) || (1 <= ldv_s_kbtab_driver_usb_driver && (((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 0 == res_kbtab_probe_3) [2019-10-22 11:25:58,853 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_s_kbtab_driver_usb_driver && ((((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && !(ldv_s_kbtab_driver_usb_driver == 1)) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && 0 == res_kbtab_probe_3) || ((((\result == 0 && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && (!(ldv_s_kbtab_driver_usb_driver == 1) && 1 <= ldv_coherent_state) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && 1 <= ldv_urb_state)) || ((((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_s_kbtab_driver_usb_driver == 0)) || ((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) [2019-10-22 11:25:58,853 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state [2019-10-22 11:25:58,854 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state [2019-10-22 11:25:58,854 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state [2019-10-22 11:25:58,854 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state [2019-10-22 11:25:58,854 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state [2019-10-22 11:25:58,854 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state [2019-10-22 11:25:58,855 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state [2019-10-22 11:25:58,855 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 [2019-10-22 11:25:58,855 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 [2019-10-22 11:25:58,855 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && 1 <= ldv_s_kbtab_driver_usb_driver) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 [2019-10-22 11:25:58,855 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && 1 <= ldv_s_kbtab_driver_usb_driver) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 [2019-10-22 11:25:58,856 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\result == 0) && error + 12 <= 0) && ldv_urb_state == 0 && ldv_s_kbtab_driver_usb_driver == 0) && 0 == ldv_coherent_state) || ((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0)) || ((((((!(error == 0) && !(\result == 0)) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) [2019-10-22 11:25:58,856 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && (!(0 == \result) || !(\result == 0))) && ldv_s_kbtab_driver_usb_driver == 0) || (((((0 == ldv_coherent_state && \result == 0) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == \result) && ldv_s_kbtab_driver_usb_driver == 0) [2019-10-22 11:25:58,857 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) || (0 == ldv_coherent_state && ((!(\result == 0) && !(0 == res_kbtab_probe_3)) && error + 12 <= 0) && ldv_urb_state == 0 && ldv_s_kbtab_driver_usb_driver == 0)) || ((((((!(error == 0) && !(\result == 0)) && !(0 == res_kbtab_probe_3)) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) [2019-10-22 11:25:58,857 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && \result == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) || (((((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && (!(\result == 0) || !(\result == 0))) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) [2019-10-22 11:25:59,018 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6f929030-376f-4be0-89bb-c87502232e13/bin/utaipan/witness.graphml [2019-10-22 11:25:59,019 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:25:59,020 INFO L168 Benchmark]: Toolchain (without parser) took 12231.41 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 504.9 MB). Free memory was 936.3 MB in the beginning and 1.1 GB in the end (delta: -115.1 MB). Peak memory consumption was 389.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:59,020 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:25:59,021 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1285.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 934.9 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:59,021 INFO L168 Benchmark]: Boogie Procedure Inliner took 110.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:59,021 INFO L168 Benchmark]: Boogie Preprocessor took 132.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:59,021 INFO L168 Benchmark]: RCFGBuilder took 1393.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 927.4 MB in the end (delta: 157.9 MB). Peak memory consumption was 157.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:59,022 INFO L168 Benchmark]: TraceAbstraction took 9081.13 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 332.9 MB). Free memory was 927.4 MB in the beginning and 1.1 GB in the end (delta: -195.5 MB). Peak memory consumption was 268.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:59,022 INFO L168 Benchmark]: Witness Printer took 222.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 71.6 MB). Peak memory consumption was 71.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:59,023 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1285.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 934.9 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 110.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 132.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1393.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 927.4 MB in the end (delta: 157.9 MB). Peak memory consumption was 157.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9081.13 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 332.9 MB). Free memory was 927.4 MB in the beginning and 1.1 GB in the end (delta: -195.5 MB). Peak memory consumption was 268.7 MB. Max. memory is 11.5 GB. * Witness Printer took 222.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 71.6 MB). Peak memory consumption was 71.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4037]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4037]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4037]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4037]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4037]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4037]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 4054]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && (!(0 == \result) || !(\result == 0))) && ldv_s_kbtab_driver_usb_driver == 0) || (((((0 == ldv_coherent_state && \result == 0) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == \result) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4248]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3996]: Loop Invariant Derived loop invariant: (((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) || (0 == ldv_coherent_state && ((!(\result == 0) && !(0 == res_kbtab_probe_3)) && error + 12 <= 0) && ldv_urb_state == 0 && ldv_s_kbtab_driver_usb_driver == 0)) || ((((((!(error == 0) && !(\result == 0)) && !(0 == res_kbtab_probe_3)) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) - InvariantResult [Line: 4248]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4248]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3453]: Loop Invariant Derived loop invariant: (0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 4248]: Loop Invariant Derived loop invariant: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state - InvariantResult [Line: 4117]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4222]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4172]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4248]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4169]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 3383]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4230]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3985]: Loop Invariant Derived loop invariant: (((1 <= ldv_s_kbtab_driver_usb_driver && ((((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && !(ldv_s_kbtab_driver_usb_driver == 1)) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && 0 == res_kbtab_probe_3) || ((((\result == 0 && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && (!(ldv_s_kbtab_driver_usb_driver == 1) && 1 <= ldv_coherent_state) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && 1 <= ldv_urb_state)) || ((((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_s_kbtab_driver_usb_driver == 0)) || ((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) - InvariantResult [Line: 3383]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4085]: Loop Invariant Derived loop invariant: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 3410]: Loop Invariant Derived loop invariant: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state - InvariantResult [Line: 3421]: Loop Invariant Derived loop invariant: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state - InvariantResult [Line: 4138]: Loop Invariant Derived loop invariant: (((((!(error == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3437]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3421]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4212]: Loop Invariant Derived loop invariant: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state - InvariantResult [Line: 4085]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) || ((((((!(error == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 3781]: Loop Invariant Derived loop invariant: (((((!(error == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3430]: Loop Invariant Derived loop invariant: ((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4138]: Loop Invariant Derived loop invariant: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 3781]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) || ((((((!(error == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4209]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3967]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3494]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4209]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3968]: Loop Invariant Derived loop invariant: (((((((\result == 0 && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && !(ldv_s_kbtab_driver_usb_driver == 1)) || (((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0)) || ((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state)) || (1 <= ldv_s_kbtab_driver_usb_driver && (((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 3982]: Loop Invariant Derived loop invariant: (((((((\result == 0 && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && !(ldv_s_kbtab_driver_usb_driver == 1)) || (((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0)) || ((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state)) || (1 <= ldv_s_kbtab_driver_usb_driver && (((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 3781]: Loop Invariant Derived loop invariant: (0 == ldv_coherent_state && error + 12 <= 0 && ldv_urb_state == 0 && ldv_s_kbtab_driver_usb_driver == 0) || (((((!(error == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 4209]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4060]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3899]: Loop Invariant Derived loop invariant: ((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) || (((retval + 1 <= 0 || 0 < retval) && 0 == ldv_coherent_state) && ldv_urb_state == 0) - InvariantResult [Line: 4046]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3500]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4046]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3949]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 3513]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4046]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4046]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4202]: Loop Invariant Derived loop invariant: (0 == ldv_coherent_state && error + 12 <= 0 && ldv_urb_state == 0 && ldv_s_kbtab_driver_usb_driver == 0) || (((((!(error == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 4188]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4081]: Loop Invariant Derived loop invariant: (((((\result == 0 && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && 1 <= ldv_s_kbtab_driver_usb_driver) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 3897]: Loop Invariant Derived loop invariant: ((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) || ((((retval + 1 <= 0 || 0 < retval) && (1 <= \result || \result + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) - InvariantResult [Line: 3393]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4081]: Loop Invariant Derived loop invariant: ((((((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) || ((((((!(error == 0) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 3770]: Loop Invariant Derived loop invariant: ((((!(\result == 0) && error + 12 <= 0) && ldv_urb_state == 0 && ldv_s_kbtab_driver_usb_driver == 0) && 0 == ldv_coherent_state) || ((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0)) || ((((((!(error == 0) && !(\result == 0)) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 4206]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4188]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3393]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4112]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && \result == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) || (((((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && (!(\result == 0) || !(\result == 0))) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4196]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4196]: Loop Invariant Derived loop invariant: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state - InvariantResult [Line: 4142]: Loop Invariant Derived loop invariant: (((((!(error == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4192]: Loop Invariant Derived loop invariant: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state - InvariantResult [Line: 3557]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4142]: Loop Invariant Derived loop invariant: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state - InvariantResult [Line: 4222]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4196]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4240]: Loop Invariant Derived loop invariant: (0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 3463]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4218]: Loop Invariant Derived loop invariant: (0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((\result == 0 && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && 1 <= ldv_s_kbtab_driver_usb_driver) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 6 error locations. Result: SAFE, OverallTime: 8.9s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.0s, HoareTripleCheckerStatistics: 3030 SDtfs, 1824 SDslu, 4115 SDs, 0 SdLazy, 278 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 162 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=844occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 1279 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 68 PreInvPairs, 185 NumberOfFragments, 2134 HoareAnnotationTreeSize, 68 FomulaSimplifications, 128681 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 68 FomulaSimplificationsInter, 5965 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1036 NumberOfCodeBlocks, 1036 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1084 ConstructedInterpolants, 0 QuantifiedInterpolants, 146097 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1065 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 20 InterpolantComputations, 19 PerfectInterpolantSequences, 16/19 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...