./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c97362a6-1d8c-4c40-951b-b1d098d88dbc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c97362a6-1d8c-4c40-951b-b1d098d88dbc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c97362a6-1d8c-4c40-951b-b1d098d88dbc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c97362a6-1d8c-4c40-951b-b1d098d88dbc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c97362a6-1d8c-4c40-951b-b1d098d88dbc/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c97362a6-1d8c-4c40-951b-b1d098d88dbc/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ab2994a8c7227b918f418529e439adce527cd876 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:47:30,914 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:47:30,916 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:47:30,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:47:30,931 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:47:30,933 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:47:30,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:47:30,942 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:47:30,946 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:47:30,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:47:30,952 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:47:30,953 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:47:30,954 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:47:30,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:47:30,957 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:47:30,958 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:47:30,958 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:47:30,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:47:30,962 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:47:30,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:47:30,969 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:47:30,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:47:30,975 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:47:30,976 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:47:30,979 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:47:30,979 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:47:30,979 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:47:30,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:47:30,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:47:30,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:47:30,982 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:47:30,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:47:30,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:47:30,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:47:30,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:47:30,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:47:30,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:47:30,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:47:30,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:47:30,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:47:30,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:47:30,989 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c97362a6-1d8c-4c40-951b-b1d098d88dbc/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-11-25 08:47:31,013 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:47:31,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:47:31,014 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:47:31,014 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:47:31,014 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:47:31,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:47:31,015 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:47:31,015 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:47:31,015 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:47:31,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:47:31,016 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:47:31,016 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:47:31,016 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:47:31,016 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:47:31,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:47:31,017 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:47:31,017 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:47:31,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:47:31,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:47:31,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:47:31,018 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:47:31,018 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:47:31,018 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:47:31,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:47:31,019 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:47:31,019 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 08:47:31,019 INFO L138 SettingsManager]: * To the following directory=dump/ Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_c97362a6-1d8c-4c40-951b-b1d098d88dbc/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ab2994a8c7227b918f418529e439adce527cd876 [2019-11-25 08:47:31,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:47:31,178 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:47:31,180 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:47:31,181 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:47:31,182 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:47:31,182 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c97362a6-1d8c-4c40-951b-b1d098d88dbc/bin/uautomizer/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2019-11-25 08:47:31,232 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c97362a6-1d8c-4c40-951b-b1d098d88dbc/bin/uautomizer/data/9adb0f7f0/6aa95ecdc2ac4f31adf2ce5550be5bb1/FLAG9a6689882 [2019-11-25 08:47:31,917 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:47:31,918 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c97362a6-1d8c-4c40-951b-b1d098d88dbc/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2019-11-25 08:47:31,960 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c97362a6-1d8c-4c40-951b-b1d098d88dbc/bin/uautomizer/data/9adb0f7f0/6aa95ecdc2ac4f31adf2ce5550be5bb1/FLAG9a6689882 [2019-11-25 08:47:32,250 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c97362a6-1d8c-4c40-951b-b1d098d88dbc/bin/uautomizer/data/9adb0f7f0/6aa95ecdc2ac4f31adf2ce5550be5bb1 [2019-11-25 08:47:32,252 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:47:32,253 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:47:32,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:47:32,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:47:32,257 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:47:32,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:47:32" (1/1) ... [2019-11-25 08:47:32,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab83fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:32, skipping insertion in model container [2019-11-25 08:47:32,260 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:47:32" (1/1) ... [2019-11-25 08:47:32,265 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:47:32,349 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:47:33,227 WARN L612 FunctionHandler]: implicit declaration of function ldv_malloc [2019-11-25 08:47:33,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:47:33,302 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:47:33,511 WARN L612 FunctionHandler]: implicit declaration of function ldv_malloc [2019-11-25 08:47:33,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:47:33,593 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:47:33,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:33 WrapperNode [2019-11-25 08:47:33,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:47:33,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:47:33,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:47:33,595 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:47:33,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:33" (1/1) ... [2019-11-25 08:47:33,653 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:33" (1/1) ... [2019-11-25 08:47:33,725 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:47:33,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:47:33,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:47:33,726 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:47:33,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:33" (1/1) ... [2019-11-25 08:47:33,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:33" (1/1) ... [2019-11-25 08:47:33,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:33" (1/1) ... [2019-11-25 08:47:33,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:33" (1/1) ... [2019-11-25 08:47:33,795 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:33" (1/1) ... [2019-11-25 08:47:33,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:33" (1/1) ... [2019-11-25 08:47:33,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:33" (1/1) ... [2019-11-25 08:47:33,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:47:33,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:47:33,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:47:33,864 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:47:33,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c97362a6-1d8c-4c40-951b-b1d098d88dbc/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:47:33,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 08:47:33,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:47:33,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:47:33,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 08:47:33,952 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-25 08:47:33,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:47:33,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-25 08:47:33,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:47:33,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-25 08:47:33,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:47:33,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:47:34,545 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:47:34,550 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:47:34,552 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:47:34,554 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:47:34,574 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:47:37,919 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##81: assume !false; [2019-11-25 08:47:37,920 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##80: assume false; [2019-11-25 08:47:37,920 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume !false; [2019-11-25 08:47:37,920 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume false; [2019-11-25 08:47:37,920 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##334: assume !false; [2019-11-25 08:47:37,920 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##333: assume false; [2019-11-25 08:47:37,921 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##104: assume !false; [2019-11-25 08:47:37,921 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##103: assume false; [2019-11-25 08:47:37,921 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##125: assume !false; [2019-11-25 08:47:37,921 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##124: assume false; [2019-11-25 08:47:37,922 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:47:37,923 INFO L284 CfgBuilder]: Removed 148 assume(true) statements. [2019-11-25 08:47:37,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:37 BoogieIcfgContainer [2019-11-25 08:47:37,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:47:37,925 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:47:37,925 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:47:37,928 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:47:37,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:47:32" (1/3) ... [2019-11-25 08:47:37,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@184b76e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:47:37, skipping insertion in model container [2019-11-25 08:47:37,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:33" (2/3) ... [2019-11-25 08:47:37,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@184b76e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:47:37, skipping insertion in model container [2019-11-25 08:47:37,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:37" (3/3) ... [2019-11-25 08:47:37,931 INFO L109 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2019-11-25 08:47:37,940 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:47:37,949 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-25 08:47:37,960 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-25 08:47:37,992 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:47:37,992 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:47:37,992 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:47:37,992 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:47:37,992 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:47:37,992 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:47:37,992 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:47:37,993 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:47:38,021 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states. [2019-11-25 08:47:38,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-25 08:47:38,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:38,029 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:38,030 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:38,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:38,035 INFO L82 PathProgramCache]: Analyzing trace with hash 986720989, now seen corresponding path program 1 times [2019-11-25 08:47:38,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:38,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082519524] [2019-11-25 08:47:38,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:38,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:38,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082519524] [2019-11-25 08:47:38,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:38,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:38,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190497782] [2019-11-25 08:47:38,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:38,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:38,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:38,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:38,636 INFO L87 Difference]: Start difference. First operand 271 states. Second operand 4 states. [2019-11-25 08:47:39,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:39,026 INFO L93 Difference]: Finished difference Result 764 states and 1178 transitions. [2019-11-25 08:47:39,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:39,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-25 08:47:39,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:39,049 INFO L225 Difference]: With dead ends: 764 [2019-11-25 08:47:39,050 INFO L226 Difference]: Without dead ends: 486 [2019-11-25 08:47:39,060 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-25 08:47:39,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-11-25 08:47:39,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 264. [2019-11-25 08:47:39,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-11-25 08:47:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 353 transitions. [2019-11-25 08:47:39,141 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 353 transitions. Word has length 12 [2019-11-25 08:47:39,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:39,141 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 353 transitions. [2019-11-25 08:47:39,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:39,141 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 353 transitions. [2019-11-25 08:47:39,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-25 08:47:39,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:39,142 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:39,142 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:39,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:39,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1666779359, now seen corresponding path program 1 times [2019-11-25 08:47:39,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:39,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939253194] [2019-11-25 08:47:39,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:39,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:39,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939253194] [2019-11-25 08:47:39,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:39,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:47:39,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596362653] [2019-11-25 08:47:39,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:39,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:39,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:39,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:39,329 INFO L87 Difference]: Start difference. First operand 264 states and 353 transitions. Second operand 3 states. [2019-11-25 08:47:39,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:39,375 INFO L93 Difference]: Finished difference Result 757 states and 1020 transitions. [2019-11-25 08:47:39,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:39,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-25 08:47:39,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:39,380 INFO L225 Difference]: With dead ends: 757 [2019-11-25 08:47:39,381 INFO L226 Difference]: Without dead ends: 507 [2019-11-25 08:47:39,383 INFO L630 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-11-25 08:47:39,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-11-25 08:47:39,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 503. [2019-11-25 08:47:39,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-11-25 08:47:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 679 transitions. [2019-11-25 08:47:39,408 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 679 transitions. Word has length 12 [2019-11-25 08:47:39,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:39,408 INFO L462 AbstractCegarLoop]: Abstraction has 503 states and 679 transitions. [2019-11-25 08:47:39,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:39,409 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 679 transitions. [2019-11-25 08:47:39,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-25 08:47:39,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:39,412 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:39,413 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:39,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:39,413 INFO L82 PathProgramCache]: Analyzing trace with hash 130552002, now seen corresponding path program 1 times [2019-11-25 08:47:39,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:39,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977404054] [2019-11-25 08:47:39,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:39,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:39,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977404054] [2019-11-25 08:47:39,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:39,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:47:39,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138602724] [2019-11-25 08:47:39,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:39,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:39,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:39,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:39,561 INFO L87 Difference]: Start difference. First operand 503 states and 679 transitions. Second operand 3 states. [2019-11-25 08:47:39,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:39,577 INFO L93 Difference]: Finished difference Result 503 states and 679 transitions. [2019-11-25 08:47:39,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:39,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-25 08:47:39,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:39,579 INFO L225 Difference]: With dead ends: 503 [2019-11-25 08:47:39,580 INFO L226 Difference]: Without dead ends: 497 [2019-11-25 08:47:39,580 INFO L630 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-11-25 08:47:39,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-11-25 08:47:39,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2019-11-25 08:47:39,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2019-11-25 08:47:39,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 670 transitions. [2019-11-25 08:47:39,603 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 670 transitions. Word has length 13 [2019-11-25 08:47:39,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:39,604 INFO L462 AbstractCegarLoop]: Abstraction has 497 states and 670 transitions. [2019-11-25 08:47:39,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:39,604 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 670 transitions. [2019-11-25 08:47:39,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-25 08:47:39,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:39,613 INFO L410 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] [2019-11-25 08:47:39,613 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:39,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:39,613 INFO L82 PathProgramCache]: Analyzing trace with hash 409357662, now seen corresponding path program 1 times [2019-11-25 08:47:39,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:39,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268520890] [2019-11-25 08:47:39,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:39,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268520890] [2019-11-25 08:47:39,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:39,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:39,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592231204] [2019-11-25 08:47:39,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:39,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:39,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:39,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:39,805 INFO L87 Difference]: Start difference. First operand 497 states and 670 transitions. Second operand 4 states. [2019-11-25 08:47:40,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:40,135 INFO L93 Difference]: Finished difference Result 1410 states and 1919 transitions. [2019-11-25 08:47:40,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:40,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-25 08:47:40,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:40,141 INFO L225 Difference]: With dead ends: 1410 [2019-11-25 08:47:40,141 INFO L226 Difference]: Without dead ends: 927 [2019-11-25 08:47:40,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-25 08:47:40,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-11-25 08:47:40,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 915. [2019-11-25 08:47:40,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2019-11-25 08:47:40,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1253 transitions. [2019-11-25 08:47:40,174 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1253 transitions. Word has length 47 [2019-11-25 08:47:40,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:40,174 INFO L462 AbstractCegarLoop]: Abstraction has 915 states and 1253 transitions. [2019-11-25 08:47:40,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:40,175 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1253 transitions. [2019-11-25 08:47:40,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-25 08:47:40,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:40,177 INFO L410 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] [2019-11-25 08:47:40,177 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:40,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:40,178 INFO L82 PathProgramCache]: Analyzing trace with hash -100115428, now seen corresponding path program 1 times [2019-11-25 08:47:40,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:40,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123562009] [2019-11-25 08:47:40,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:40,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:40,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123562009] [2019-11-25 08:47:40,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:40,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:47:40,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474579383] [2019-11-25 08:47:40,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:47:40,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:40,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:47:40,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:47:40,355 INFO L87 Difference]: Start difference. First operand 915 states and 1253 transitions. Second operand 6 states. [2019-11-25 08:47:40,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:40,582 INFO L93 Difference]: Finished difference Result 2233 states and 3065 transitions. [2019-11-25 08:47:40,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:47:40,583 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-11-25 08:47:40,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:40,592 INFO L225 Difference]: With dead ends: 2233 [2019-11-25 08:47:40,593 INFO L226 Difference]: Without dead ends: 1776 [2019-11-25 08:47:40,594 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:47:40,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2019-11-25 08:47:40,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 919. [2019-11-25 08:47:40,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2019-11-25 08:47:40,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1257 transitions. [2019-11-25 08:47:40,657 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1257 transitions. Word has length 47 [2019-11-25 08:47:40,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:40,657 INFO L462 AbstractCegarLoop]: Abstraction has 919 states and 1257 transitions. [2019-11-25 08:47:40,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:47:40,657 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1257 transitions. [2019-11-25 08:47:40,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-25 08:47:40,659 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:40,659 INFO L410 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] [2019-11-25 08:47:40,659 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:40,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:40,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1465790299, now seen corresponding path program 1 times [2019-11-25 08:47:40,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:40,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614765053] [2019-11-25 08:47:40,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:40,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614765053] [2019-11-25 08:47:40,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:40,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:40,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566146646] [2019-11-25 08:47:40,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:40,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:40,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:40,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:40,840 INFO L87 Difference]: Start difference. First operand 919 states and 1257 transitions. Second operand 4 states. [2019-11-25 08:47:41,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:41,076 INFO L93 Difference]: Finished difference Result 2621 states and 3604 transitions. [2019-11-25 08:47:41,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:41,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-25 08:47:41,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:41,087 INFO L225 Difference]: With dead ends: 2621 [2019-11-25 08:47:41,087 INFO L226 Difference]: Without dead ends: 1716 [2019-11-25 08:47:41,089 INFO L630 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-11-25 08:47:41,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2019-11-25 08:47:41,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 895. [2019-11-25 08:47:41,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-11-25 08:47:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1223 transitions. [2019-11-25 08:47:41,160 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1223 transitions. Word has length 48 [2019-11-25 08:47:41,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:41,161 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1223 transitions. [2019-11-25 08:47:41,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:41,161 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1223 transitions. [2019-11-25 08:47:41,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-25 08:47:41,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:41,162 INFO L410 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] [2019-11-25 08:47:41,166 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:41,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:41,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1207624861, now seen corresponding path program 1 times [2019-11-25 08:47:41,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:41,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627492880] [2019-11-25 08:47:41,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:41,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:41,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627492880] [2019-11-25 08:47:41,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:41,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:41,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119939861] [2019-11-25 08:47:41,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:41,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:41,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:41,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:41,404 INFO L87 Difference]: Start difference. First operand 895 states and 1223 transitions. Second operand 4 states. [2019-11-25 08:47:41,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:41,736 INFO L93 Difference]: Finished difference Result 4015 states and 5492 transitions. [2019-11-25 08:47:41,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:47:41,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-25 08:47:41,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:41,752 INFO L225 Difference]: With dead ends: 4015 [2019-11-25 08:47:41,752 INFO L226 Difference]: Without dead ends: 3134 [2019-11-25 08:47:41,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-25 08:47:41,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3134 states. [2019-11-25 08:47:41,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3134 to 1707. [2019-11-25 08:47:41,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-25 08:47:41,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2328 transitions. [2019-11-25 08:47:41,862 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2328 transitions. Word has length 48 [2019-11-25 08:47:41,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:41,862 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 2328 transitions. [2019-11-25 08:47:41,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:41,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2328 transitions. [2019-11-25 08:47:41,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-25 08:47:41,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:41,864 INFO L410 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] [2019-11-25 08:47:41,864 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:41,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:41,865 INFO L82 PathProgramCache]: Analyzing trace with hash -825195351, now seen corresponding path program 1 times [2019-11-25 08:47:41,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:41,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047568252] [2019-11-25 08:47:41,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:41,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:41,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047568252] [2019-11-25 08:47:41,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:41,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:41,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639186469] [2019-11-25 08:47:41,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:41,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:41,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:41,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:41,985 INFO L87 Difference]: Start difference. First operand 1707 states and 2328 transitions. Second operand 4 states. [2019-11-25 08:47:42,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:42,379 INFO L93 Difference]: Finished difference Result 3339 states and 4541 transitions. [2019-11-25 08:47:42,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:42,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-25 08:47:42,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:42,388 INFO L225 Difference]: With dead ends: 3339 [2019-11-25 08:47:42,388 INFO L226 Difference]: Without dead ends: 1646 [2019-11-25 08:47:42,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-25 08:47:42,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2019-11-25 08:47:42,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1631. [2019-11-25 08:47:42,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1631 states. [2019-11-25 08:47:42,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2212 transitions. [2019-11-25 08:47:42,492 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2212 transitions. Word has length 48 [2019-11-25 08:47:42,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:42,494 INFO L462 AbstractCegarLoop]: Abstraction has 1631 states and 2212 transitions. [2019-11-25 08:47:42,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:42,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2212 transitions. [2019-11-25 08:47:42,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-25 08:47:42,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:42,495 INFO L410 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-11-25 08:47:42,495 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:42,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:42,496 INFO L82 PathProgramCache]: Analyzing trace with hash -194665891, now seen corresponding path program 1 times [2019-11-25 08:47:42,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:42,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720300337] [2019-11-25 08:47:42,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:42,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:42,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720300337] [2019-11-25 08:47:42,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:42,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:42,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62803966] [2019-11-25 08:47:42,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:42,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:42,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:42,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:42,688 INFO L87 Difference]: Start difference. First operand 1631 states and 2212 transitions. Second operand 4 states. [2019-11-25 08:47:43,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:43,934 INFO L93 Difference]: Finished difference Result 2470 states and 3352 transitions. [2019-11-25 08:47:43,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:43,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-25 08:47:43,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:43,947 INFO L225 Difference]: With dead ends: 2470 [2019-11-25 08:47:43,947 INFO L226 Difference]: Without dead ends: 2466 [2019-11-25 08:47:43,948 INFO L630 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-11-25 08:47:43,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2019-11-25 08:47:44,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 2461. [2019-11-25 08:47:44,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2461 states. [2019-11-25 08:47:44,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 3340 transitions. [2019-11-25 08:47:44,091 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 3340 transitions. Word has length 56 [2019-11-25 08:47:44,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:44,093 INFO L462 AbstractCegarLoop]: Abstraction has 2461 states and 3340 transitions. [2019-11-25 08:47:44,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:44,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 3340 transitions. [2019-11-25 08:47:44,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-25 08:47:44,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:44,095 INFO L410 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] [2019-11-25 08:47:44,095 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:44,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:44,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1415381805, now seen corresponding path program 1 times [2019-11-25 08:47:44,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:44,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809035] [2019-11-25 08:47:44,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:44,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:44,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809035] [2019-11-25 08:47:44,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:44,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 08:47:44,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572882535] [2019-11-25 08:47:44,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:47:44,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:44,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:47:44,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:47:44,341 INFO L87 Difference]: Start difference. First operand 2461 states and 3340 transitions. Second operand 8 states. [2019-11-25 08:47:44,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:44,916 INFO L93 Difference]: Finished difference Result 4120 states and 5586 transitions. [2019-11-25 08:47:44,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:47:44,917 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-11-25 08:47:44,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:44,930 INFO L225 Difference]: With dead ends: 4120 [2019-11-25 08:47:44,930 INFO L226 Difference]: Without dead ends: 2445 [2019-11-25 08:47:44,933 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-11-25 08:47:44,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2019-11-25 08:47:45,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 1689. [2019-11-25 08:47:45,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1689 states. [2019-11-25 08:47:45,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2270 transitions. [2019-11-25 08:47:45,043 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2270 transitions. Word has length 62 [2019-11-25 08:47:45,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:45,044 INFO L462 AbstractCegarLoop]: Abstraction has 1689 states and 2270 transitions. [2019-11-25 08:47:45,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:47:45,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2270 transitions. [2019-11-25 08:47:45,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-25 08:47:45,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:45,046 INFO L410 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] [2019-11-25 08:47:45,046 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:45,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:45,047 INFO L82 PathProgramCache]: Analyzing trace with hash -2058303986, now seen corresponding path program 1 times [2019-11-25 08:47:45,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:45,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969103133] [2019-11-25 08:47:45,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:45,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:47:45,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969103133] [2019-11-25 08:47:45,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:45,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:47:45,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81871299] [2019-11-25 08:47:45,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:47:45,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:45,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:47:45,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:47:45,603 INFO L87 Difference]: Start difference. First operand 1689 states and 2270 transitions. Second operand 5 states. [2019-11-25 08:47:45,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:45,756 INFO L93 Difference]: Finished difference Result 3366 states and 4526 transitions. [2019-11-25 08:47:45,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:47:45,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-11-25 08:47:45,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:45,765 INFO L225 Difference]: With dead ends: 3366 [2019-11-25 08:47:45,766 INFO L226 Difference]: Without dead ends: 1687 [2019-11-25 08:47:45,768 INFO L630 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-11-25 08:47:45,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2019-11-25 08:47:45,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1687. [2019-11-25 08:47:45,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1687 states. [2019-11-25 08:47:45,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 2266 transitions. [2019-11-25 08:47:45,875 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 2266 transitions. Word has length 64 [2019-11-25 08:47:45,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:45,876 INFO L462 AbstractCegarLoop]: Abstraction has 1687 states and 2266 transitions. [2019-11-25 08:47:45,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:47:45,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2266 transitions. [2019-11-25 08:47:45,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 08:47:45,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:45,878 INFO L410 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] [2019-11-25 08:47:45,878 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:45,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:45,879 INFO L82 PathProgramCache]: Analyzing trace with hash 2039184645, now seen corresponding path program 1 times [2019-11-25 08:47:45,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:45,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798418687] [2019-11-25 08:47:45,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:46,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:47:46,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798418687] [2019-11-25 08:47:46,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:46,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:46,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144547098] [2019-11-25 08:47:46,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:46,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:46,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:46,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:46,453 INFO L87 Difference]: Start difference. First operand 1687 states and 2266 transitions. Second operand 4 states. [2019-11-25 08:47:47,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:47,536 INFO L93 Difference]: Finished difference Result 1687 states and 2266 transitions. [2019-11-25 08:47:47,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:47,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-25 08:47:47,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:47,536 INFO L225 Difference]: With dead ends: 1687 [2019-11-25 08:47:47,536 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:47:47,538 INFO L630 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-11-25 08:47:47,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:47:47,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:47:47,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:47:47,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:47:47,540 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2019-11-25 08:47:47,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:47,540 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:47:47,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:47,543 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:47:47,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:47:47,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:47:50,230 INFO L444 ceAbstractionStarter]: For program point L3933(lines 3933 3939) no Hoare annotation was computed. [2019-11-25 08:47:50,230 INFO L440 ceAbstractionStarter]: At program point L3867(lines 3809 3961) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,231 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4901) no Hoare annotation was computed. [2019-11-25 08:47:50,231 INFO L444 ceAbstractionStarter]: For program point L4132(lines 4132 4138) no Hoare annotation was computed. [2019-11-25 08:47:50,231 INFO L444 ceAbstractionStarter]: For program point L4066(lines 4066 4113) no Hoare annotation was computed. [2019-11-25 08:47:50,231 INFO L444 ceAbstractionStarter]: For program point L4066-1(lines 4066 4113) no Hoare annotation was computed. [2019-11-25 08:47:50,231 INFO L440 ceAbstractionStarter]: At program point L5057(lines 5056 5058) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,231 INFO L444 ceAbstractionStarter]: For program point L4200(lines 4200 4255) no Hoare annotation was computed. [2019-11-25 08:47:50,231 INFO L440 ceAbstractionStarter]: At program point L5125(lines 5124 5126) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,231 INFO L440 ceAbstractionStarter]: At program point L4002loopEntry(lines 4002 4017) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,231 INFO L440 ceAbstractionStarter]: At program point L4267loopEntry(lines 4267 4277) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,232 INFO L440 ceAbstractionStarter]: At program point L4201(lines 4200 4255) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,232 INFO L444 ceAbstractionStarter]: For program point L4069-1(lines 4069 4113) no Hoare annotation was computed. [2019-11-25 08:47:50,232 INFO L440 ceAbstractionStarter]: At program point L5060-1(lines 5059 5061) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,232 INFO L444 ceAbstractionStarter]: For program point L4069(lines 4069 4113) no Hoare annotation was computed. [2019-11-25 08:47:50,232 INFO L440 ceAbstractionStarter]: At program point L5060(lines 5059 5061) the Hoare annotation is: (and (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0)) [2019-11-25 08:47:50,232 INFO L444 ceAbstractionStarter]: For program point L4003(line 4003) no Hoare annotation was computed. [2019-11-25 08:47:50,232 INFO L444 ceAbstractionStarter]: For program point L4268(line 4268) no Hoare annotation was computed. [2019-11-25 08:47:50,232 INFO L440 ceAbstractionStarter]: At program point L4070(lines 4066 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,232 INFO L444 ceAbstractionStarter]: For program point L4995(lines 4980 4996) no Hoare annotation was computed. [2019-11-25 08:47:50,233 INFO L444 ceAbstractionStarter]: For program point L4004(lines 4004 4015) no Hoare annotation was computed. [2019-11-25 08:47:50,233 INFO L440 ceAbstractionStarter]: At program point L4070-1(lines 4066 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,233 INFO L444 ceAbstractionStarter]: For program point L3872(line 3872) no Hoare annotation was computed. [2019-11-25 08:47:50,233 INFO L440 ceAbstractionStarter]: At program point L3674(lines 3667 3676) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,233 INFO L444 ceAbstractionStarter]: For program point L4203(lines 4203 4255) no Hoare annotation was computed. [2019-11-25 08:47:50,233 INFO L444 ceAbstractionStarter]: For program point L4269(lines 4269 4275) no Hoare annotation was computed. [2019-11-25 08:47:50,233 INFO L444 ceAbstractionStarter]: For program point L4005(lines 4005 4009) no Hoare annotation was computed. [2019-11-25 08:47:50,233 INFO L444 ceAbstractionStarter]: For program point L4005-2(lines 4005 4009) no Hoare annotation was computed. [2019-11-25 08:47:50,233 INFO L444 ceAbstractionStarter]: For program point L3873(lines 3873 3879) no Hoare annotation was computed. [2019-11-25 08:47:50,234 INFO L440 ceAbstractionStarter]: At program point L4204(lines 4203 4255) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,234 INFO L444 ceAbstractionStarter]: For program point L4072(lines 4072 4113) no Hoare annotation was computed. [2019-11-25 08:47:50,234 INFO L440 ceAbstractionStarter]: At program point L5129(lines 5128 5130) the Hoare annotation is: (and (= 0 (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|)) (= ~ir_add_bof~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0)) [2019-11-25 08:47:50,234 INFO L444 ceAbstractionStarter]: For program point L4072-1(lines 4072 4113) no Hoare annotation was computed. [2019-11-25 08:47:50,234 INFO L440 ceAbstractionStarter]: At program point L4535(lines 4503 4536) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,234 INFO L440 ceAbstractionStarter]: At program point L4469(lines 4457 4470) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,234 INFO L440 ceAbstractionStarter]: At program point L4073-1(lines 4072 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,234 INFO L440 ceAbstractionStarter]: At program point L4073(lines 4072 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,234 INFO L440 ceAbstractionStarter]: At program point L4998(lines 4976 5000) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0)) (.cse2 (= 0 ~ldv_coherent_state~0)) (.cse1 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0)) (.cse4 (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base))) (or (and .cse0 (not .cse1) (<= ~ldv_urb_state~0 1) .cse2 .cse3 .cse4 (<= 1 ~ldv_urb_state~0)) (and .cse0 .cse2 .cse1 .cse3 (= ~ldv_urb_state~0 0) .cse4))) [2019-11-25 08:47:50,235 INFO L440 ceAbstractionStarter]: At program point L5064(lines 5063 5065) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,235 INFO L440 ceAbstractionStarter]: At program point L3611(lines 3608 3613) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,235 INFO L440 ceAbstractionStarter]: At program point L4338(lines 4321 4339) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,235 INFO L444 ceAbstractionStarter]: For program point L4206(lines 4206 4255) no Hoare annotation was computed. [2019-11-25 08:47:50,235 INFO L440 ceAbstractionStarter]: At program point L4140loopEntry(lines 4140 4196) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,235 INFO L440 ceAbstractionStarter]: At program point L3942(lines 3809 3961) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,235 INFO L440 ceAbstractionStarter]: At program point L4207(lines 4206 4255) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,235 INFO L444 ceAbstractionStarter]: For program point L4141(line 4141) no Hoare annotation was computed. [2019-11-25 08:47:50,235 INFO L444 ceAbstractionStarter]: For program point L4075-1(lines 4075 4113) no Hoare annotation was computed. [2019-11-25 08:47:50,235 INFO L444 ceAbstractionStarter]: For program point L4075(lines 4075 4113) no Hoare annotation was computed. [2019-11-25 08:47:50,236 INFO L440 ceAbstractionStarter]: At program point L3811loopEntry(lines 3811 3821) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,236 INFO L444 ceAbstractionStarter]: For program point L4538(lines 4538 4546) no Hoare annotation was computed. [2019-11-25 08:47:50,236 INFO L444 ceAbstractionStarter]: For program point L4538-2(lines 4538 4546) no Hoare annotation was computed. [2019-11-25 08:47:50,236 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4901) no Hoare annotation was computed. [2019-11-25 08:47:50,236 INFO L444 ceAbstractionStarter]: For program point L4142(lines 4142 4194) no Hoare annotation was computed. [2019-11-25 08:47:50,236 INFO L440 ceAbstractionStarter]: At program point L4076(lines 4075 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,236 INFO L440 ceAbstractionStarter]: At program point L5133(lines 5132 5134) the Hoare annotation is: (and (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0)) [2019-11-25 08:47:50,236 INFO L440 ceAbstractionStarter]: At program point L4076-1(lines 4075 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,236 INFO L444 ceAbstractionStarter]: For program point L3812(line 3812) no Hoare annotation was computed. [2019-11-25 08:47:50,236 INFO L444 ceAbstractionStarter]: For program point L4209(lines 4209 4255) no Hoare annotation was computed. [2019-11-25 08:47:50,237 INFO L444 ceAbstractionStarter]: For program point L4143(lines 4143 4147) no Hoare annotation was computed. [2019-11-25 08:47:50,237 INFO L444 ceAbstractionStarter]: For program point L4143-2(lines 4143 4147) no Hoare annotation was computed. [2019-11-25 08:47:50,237 INFO L444 ceAbstractionStarter]: For program point L3813(lines 3813 3819) no Hoare annotation was computed. [2019-11-25 08:47:50,237 INFO L444 ceAbstractionStarter]: For program point L4606(lines 4606 4610) no Hoare annotation was computed. [2019-11-25 08:47:50,237 INFO L444 ceAbstractionStarter]: For program point L4606-2(lines 4606 4610) no Hoare annotation was computed. [2019-11-25 08:47:50,237 INFO L440 ceAbstractionStarter]: At program point L4210(lines 4209 4255) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,237 INFO L444 ceAbstractionStarter]: For program point L4078(lines 4078 4113) no Hoare annotation was computed. [2019-11-25 08:47:50,237 INFO L444 ceAbstractionStarter]: For program point L4078-1(lines 4078 4113) no Hoare annotation was computed. [2019-11-25 08:47:50,237 INFO L444 ceAbstractionStarter]: For program point L4475(lines 4475 4537) no Hoare annotation was computed. [2019-11-25 08:47:50,237 INFO L444 ceAbstractionStarter]: For program point L5136-1(lines 5136 5138) no Hoare annotation was computed. [2019-11-25 08:47:50,238 INFO L444 ceAbstractionStarter]: For program point L5136-2(lines 5136 5138) no Hoare annotation was computed. [2019-11-25 08:47:50,238 INFO L440 ceAbstractionStarter]: At program point L4079-1(lines 4078 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,238 INFO L440 ceAbstractionStarter]: At program point L4079(lines 4078 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,238 INFO L440 ceAbstractionStarter]: At program point L5136(lines 1 5138) the Hoare annotation is: (and (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0)) [2019-11-25 08:47:50,238 INFO L444 ceAbstractionStarter]: For program point L3947(line 3947) no Hoare annotation was computed. [2019-11-25 08:47:50,238 INFO L444 ceAbstractionStarter]: For program point L4806(lines 4806 4809) no Hoare annotation was computed. [2019-11-25 08:47:50,238 INFO L440 ceAbstractionStarter]: At program point L4476(lines 4475 4537) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,238 INFO L440 ceAbstractionStarter]: At program point L4278(lines 4266 4279) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,238 INFO L444 ceAbstractionStarter]: For program point L4212(lines 4212 4255) no Hoare annotation was computed. [2019-11-25 08:47:50,239 INFO L444 ceAbstractionStarter]: For program point L3948(lines 3948 3954) no Hoare annotation was computed. [2019-11-25 08:47:50,239 INFO L440 ceAbstractionStarter]: At program point L3882(lines 3809 3961) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,239 INFO L440 ceAbstractionStarter]: At program point L3684(lines 3678 3686) the Hoare annotation is: (and (= 0 (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|)) (= ~ir_add_bof~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0)) [2019-11-25 08:47:50,239 INFO L440 ceAbstractionStarter]: At program point L3618loopEntry(lines 3618 3624) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,239 INFO L440 ceAbstractionStarter]: At program point L4213(lines 4212 4255) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,239 INFO L444 ceAbstractionStarter]: For program point L4081-1(lines 4081 4113) no Hoare annotation was computed. [2019-11-25 08:47:50,239 INFO L444 ceAbstractionStarter]: For program point L4081(lines 4081 4113) no Hoare annotation was computed. [2019-11-25 08:47:50,239 INFO L440 ceAbstractionStarter]: At program point L5006loopEntry(lines 5006 5025) the Hoare annotation is: (and (= ULTIMATE.start_usb_free_urb_~urb.base 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0)) [2019-11-25 08:47:50,239 INFO L440 ceAbstractionStarter]: At program point L5006-2loopEntry(lines 5006 5025) the Hoare annotation is: (and (= ULTIMATE.start_usb_free_urb_~urb.base 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0)) [2019-11-25 08:47:50,240 INFO L444 ceAbstractionStarter]: For program point L3619(line 3619) no Hoare annotation was computed. [2019-11-25 08:47:50,240 INFO L444 ceAbstractionStarter]: For program point L4478(lines 4478 4537) no Hoare annotation was computed. [2019-11-25 08:47:50,240 INFO L444 ceAbstractionStarter]: For program point L4346(lines 4346 4356) no Hoare annotation was computed. [2019-11-25 08:47:50,240 INFO L444 ceAbstractionStarter]: For program point L4346-2(lines 4346 4356) no Hoare annotation was computed. [2019-11-25 08:47:50,240 INFO L444 ceAbstractionStarter]: For program point L4148(lines 4148 4152) no Hoare annotation was computed. [2019-11-25 08:47:50,240 INFO L440 ceAbstractionStarter]: At program point L4082(lines 4081 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,240 INFO L444 ceAbstractionStarter]: For program point L4148-2(lines 4148 4152) no Hoare annotation was computed. [2019-11-25 08:47:50,240 INFO L444 ceAbstractionStarter]: For program point L5007(lines 5006 5025) no Hoare annotation was computed. [2019-11-25 08:47:50,240 INFO L440 ceAbstractionStarter]: At program point L4082-1(lines 4081 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,240 INFO L444 ceAbstractionStarter]: For program point L5007-1(lines 5006 5025) no Hoare annotation was computed. [2019-11-25 08:47:50,241 INFO L440 ceAbstractionStarter]: At program point L4479(lines 4478 4537) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,241 INFO L444 ceAbstractionStarter]: For program point L4215(lines 4215 4255) no Hoare annotation was computed. [2019-11-25 08:47:50,241 INFO L440 ceAbstractionStarter]: At program point L5074(lines 4849 4852) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,241 INFO L444 ceAbstractionStarter]: For program point L5008-1(lines 5006 5025) no Hoare annotation was computed. [2019-11-25 08:47:50,241 INFO L444 ceAbstractionStarter]: For program point L5008(lines 5006 5025) no Hoare annotation was computed. [2019-11-25 08:47:50,241 INFO L440 ceAbstractionStarter]: At program point L4216(lines 4215 4255) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,241 INFO L440 ceAbstractionStarter]: At program point L4084(lines 4083 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,241 INFO L440 ceAbstractionStarter]: At program point L4084-1(lines 4083 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,241 INFO L444 ceAbstractionStarter]: For program point L4481(lines 4481 4537) no Hoare annotation was computed. [2019-11-25 08:47:50,241 INFO L440 ceAbstractionStarter]: At program point L4283-2(lines 4283 4291) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,242 INFO L444 ceAbstractionStarter]: For program point L3887(line 3887) no Hoare annotation was computed. [2019-11-25 08:47:50,242 INFO L444 ceAbstractionStarter]: For program point L4614(lines 4614 4617) no Hoare annotation was computed. [2019-11-25 08:47:50,242 INFO L440 ceAbstractionStarter]: At program point L4482(lines 4481 4537) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,242 INFO L444 ceAbstractionStarter]: For program point L4218(lines 4218 4255) no Hoare annotation was computed. [2019-11-25 08:47:50,242 INFO L444 ceAbstractionStarter]: For program point L4284(lines 4283 4291) no Hoare annotation was computed. [2019-11-25 08:47:50,242 INFO L440 ceAbstractionStarter]: At program point L5077(lines 5076 5078) the Hoare annotation is: (and (= 0 (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|)) (= ~ir_add_bof~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0)) [2019-11-25 08:47:50,242 INFO L444 ceAbstractionStarter]: For program point L3888(lines 3888 3894) no Hoare annotation was computed. [2019-11-25 08:47:50,242 INFO L440 ceAbstractionStarter]: At program point L3822(lines 3809 3961) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,242 INFO L444 ceAbstractionStarter]: For program point L4813(line 4813) no Hoare annotation was computed. [2019-11-25 08:47:50,242 INFO L440 ceAbstractionStarter]: At program point L4219(lines 4218 4255) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,243 INFO L444 ceAbstractionStarter]: For program point L4285(lines 4285 4288) no Hoare annotation was computed. [2019-11-25 08:47:50,243 INFO L444 ceAbstractionStarter]: For program point L4153(lines 4153 4157) no Hoare annotation was computed. [2019-11-25 08:47:50,243 INFO L444 ceAbstractionStarter]: For program point L4153-2(lines 4153 4157) no Hoare annotation was computed. [2019-11-25 08:47:50,243 INFO L440 ceAbstractionStarter]: At program point L4880(lines 4812 4883) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,243 INFO L440 ceAbstractionStarter]: At program point L3625(lines 3614 3630) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,243 INFO L444 ceAbstractionStarter]: For program point L4484(lines 4484 4537) no Hoare annotation was computed. [2019-11-25 08:47:50,243 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:47:50,243 INFO L440 ceAbstractionStarter]: At program point L4485(lines 4484 4537) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,243 INFO L444 ceAbstractionStarter]: For program point L4221(lines 4221 4255) no Hoare annotation was computed. [2019-11-25 08:47:50,243 INFO L440 ceAbstractionStarter]: At program point L5080(lines 5079 5081) the Hoare annotation is: (and (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,244 INFO L440 ceAbstractionStarter]: At program point L3957(lines 3807 3962) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,244 INFO L444 ceAbstractionStarter]: For program point L4552(lines 4552 4558) no Hoare annotation was computed. [2019-11-25 08:47:50,244 INFO L440 ceAbstractionStarter]: At program point L4222(lines 4221 4255) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,244 INFO L444 ceAbstractionStarter]: For program point L5015(lines 5015 5020) no Hoare annotation was computed. [2019-11-25 08:47:50,244 INFO L444 ceAbstractionStarter]: For program point L4024(lines 4024 4042) no Hoare annotation was computed. [2019-11-25 08:47:50,244 INFO L444 ceAbstractionStarter]: For program point L5015-2(lines 5015 5020) no Hoare annotation was computed. [2019-11-25 08:47:50,244 INFO L444 ceAbstractionStarter]: For program point L4817(lines 4817 4822) no Hoare annotation was computed. [2019-11-25 08:47:50,244 INFO L444 ceAbstractionStarter]: For program point L4487(lines 4487 4537) no Hoare annotation was computed. [2019-11-25 08:47:50,244 INFO L444 ceAbstractionStarter]: For program point L3827(line 3827) no Hoare annotation was computed. [2019-11-25 08:47:50,244 INFO L440 ceAbstractionStarter]: At program point L4884(lines 4811 4885) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,244 INFO L440 ceAbstractionStarter]: At program point L4488(lines 4487 4537) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,245 INFO L444 ceAbstractionStarter]: For program point L4158(lines 4158 4162) no Hoare annotation was computed. [2019-11-25 08:47:50,245 INFO L444 ceAbstractionStarter]: For program point L4158-2(lines 4158 4162) no Hoare annotation was computed. [2019-11-25 08:47:50,245 INFO L440 ceAbstractionStarter]: At program point L4026loopEntry(lines 4026 4036) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,245 INFO L444 ceAbstractionStarter]: For program point L4819(lines 4819 4822) no Hoare annotation was computed. [2019-11-25 08:47:50,245 INFO L444 ceAbstractionStarter]: For program point L3828(lines 3828 3834) no Hoare annotation was computed. [2019-11-25 08:47:50,245 INFO L444 ceAbstractionStarter]: For program point L4819-1(lines 4817 4822) no Hoare annotation was computed. [2019-11-25 08:47:50,245 INFO L444 ceAbstractionStarter]: For program point L4621(lines 4621 4624) no Hoare annotation was computed. [2019-11-25 08:47:50,245 INFO L444 ceAbstractionStarter]: For program point L4027(line 4027) no Hoare annotation was computed. [2019-11-25 08:47:50,245 INFO L440 ceAbstractionStarter]: At program point L4622(lines 4605 4635) the Hoare annotation is: (and (= 0 (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|)) (= ~ir_add_bof~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (or (<= (+ ULTIMATE.start_ir_init_~retval~0 1) 0) (< 0 ULTIMATE.start_ir_init_~retval~0)) (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0)) [2019-11-25 08:47:50,245 INFO L444 ceAbstractionStarter]: For program point L4490(lines 4490 4537) no Hoare annotation was computed. [2019-11-25 08:47:50,246 INFO L440 ceAbstractionStarter]: At program point L4292(lines 4282 4293) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,246 INFO L444 ceAbstractionStarter]: For program point L4028(lines 4028 4034) no Hoare annotation was computed. [2019-11-25 08:47:50,246 INFO L440 ceAbstractionStarter]: At program point L4491(lines 4490 4537) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,246 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-25 08:47:50,246 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4901) no Hoare annotation was computed. [2019-11-25 08:47:50,246 INFO L440 ceAbstractionStarter]: At program point L3897(lines 3809 3961) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,246 INFO L440 ceAbstractionStarter]: At program point L5087(lines 5086 5088) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,246 INFO L440 ceAbstractionStarter]: At program point L3700(lines 3688 3702) the Hoare annotation is: (and (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0)) [2019-11-25 08:47:50,246 INFO L444 ceAbstractionStarter]: For program point L4493(lines 4493 4537) no Hoare annotation was computed. [2019-11-25 08:47:50,247 INFO L444 ceAbstractionStarter]: For program point L4163(lines 4163 4167) no Hoare annotation was computed. [2019-11-25 08:47:50,247 INFO L444 ceAbstractionStarter]: For program point L4163-2(lines 4163 4167) no Hoare annotation was computed. [2019-11-25 08:47:50,247 INFO L440 ceAbstractionStarter]: At program point L4494(lines 4493 4537) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,247 INFO L440 ceAbstractionStarter]: At program point L5090(lines 5089 5091) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,247 INFO L444 ceAbstractionStarter]: For program point L4826(lines 4826 4882) no Hoare annotation was computed. [2019-11-25 08:47:50,247 INFO L444 ceAbstractionStarter]: For program point L4496(lines 4496 4537) no Hoare annotation was computed. [2019-11-25 08:47:50,247 INFO L440 ceAbstractionStarter]: At program point L4298(lines 4262 4300) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,247 INFO L444 ceAbstractionStarter]: For program point L3902(line 3902) no Hoare annotation was computed. [2019-11-25 08:47:50,247 INFO L440 ceAbstractionStarter]: At program point L4827(lines 4826 4882) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,247 INFO L444 ceAbstractionStarter]: For program point L4563(lines 4563 4569) no Hoare annotation was computed. [2019-11-25 08:47:50,248 INFO L440 ceAbstractionStarter]: At program point L4497(lines 4496 4537) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,248 INFO L440 ceAbstractionStarter]: At program point L4365(lines 4301 4367) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,248 INFO L444 ceAbstractionStarter]: For program point L3903(lines 3903 3909) no Hoare annotation was computed. [2019-11-25 08:47:50,248 INFO L440 ceAbstractionStarter]: At program point L3837(lines 3809 3961) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,248 INFO L444 ceAbstractionStarter]: For program point L4168(lines 4168 4172) no Hoare annotation was computed. [2019-11-25 08:47:50,248 INFO L444 ceAbstractionStarter]: For program point L4168-2(lines 4168 4172) no Hoare annotation was computed. [2019-11-25 08:47:50,248 INFO L447 ceAbstractionStarter]: At program point L4895(lines 4788 4897) the Hoare annotation is: true [2019-11-25 08:47:50,248 INFO L444 ceAbstractionStarter]: For program point L4829(lines 4829 4882) no Hoare annotation was computed. [2019-11-25 08:47:50,248 INFO L440 ceAbstractionStarter]: At program point L3640(lines 3633 3642) the Hoare annotation is: (and (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0)) [2019-11-25 08:47:50,249 INFO L440 ceAbstractionStarter]: At program point L3640-1(lines 3633 3642) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,249 INFO L444 ceAbstractionStarter]: For program point L4499(lines 4499 4537) no Hoare annotation was computed. [2019-11-25 08:47:50,249 INFO L440 ceAbstractionStarter]: At program point L5094(lines 5093 5095) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,249 INFO L440 ceAbstractionStarter]: At program point L4037(lines 3970 4052) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,249 INFO L440 ceAbstractionStarter]: At program point L4830(lines 4829 4882) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,249 INFO L440 ceAbstractionStarter]: At program point L4500(lines 4499 4537) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,249 INFO L444 ceAbstractionStarter]: For program point L4898(lines 1 5138) no Hoare annotation was computed. [2019-11-25 08:47:50,249 INFO L447 ceAbstractionStarter]: At program point L4898-3(lines 5033 5050) the Hoare annotation is: true [2019-11-25 08:47:50,249 INFO L444 ceAbstractionStarter]: For program point L4898-1(lines 1 5138) no Hoare annotation was computed. [2019-11-25 08:47:50,250 INFO L444 ceAbstractionStarter]: For program point L4832(lines 4832 4882) no Hoare annotation was computed. [2019-11-25 08:47:50,250 INFO L444 ceAbstractionStarter]: For program point L4898-2(lines 5042 5047) no Hoare annotation was computed. [2019-11-25 08:47:50,250 INFO L440 ceAbstractionStarter]: At program point L4634(lines 4603 4636) the Hoare annotation is: (and (= 0 (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|)) (= ~ir_add_bof~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (= 0 (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1)) (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,250 INFO L440 ceAbstractionStarter]: At program point L4502(lines 4501 4537) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,250 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4901) no Hoare annotation was computed. [2019-11-25 08:47:50,250 INFO L444 ceAbstractionStarter]: For program point L3842(line 3842) no Hoare annotation was computed. [2019-11-25 08:47:50,250 INFO L440 ceAbstractionStarter]: At program point L4833(lines 4832 4882) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,250 INFO L444 ceAbstractionStarter]: For program point L4173(lines 4173 4177) no Hoare annotation was computed. [2019-11-25 08:47:50,250 INFO L440 ceAbstractionStarter]: At program point L5098(lines 5097 5099) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,251 INFO L444 ceAbstractionStarter]: For program point L4173-2(lines 4173 4177) no Hoare annotation was computed. [2019-11-25 08:47:50,251 INFO L444 ceAbstractionStarter]: For program point L3975(lines 3975 3978) no Hoare annotation was computed. [2019-11-25 08:47:50,251 INFO L444 ceAbstractionStarter]: For program point L3843(lines 3843 3849) no Hoare annotation was computed. [2019-11-25 08:47:50,251 INFO L444 ceAbstractionStarter]: For program point L4835(lines 4835 4882) no Hoare annotation was computed. [2019-11-25 08:47:50,251 INFO L444 ceAbstractionStarter]: For program point L4901-2(line 4901) no Hoare annotation was computed. [2019-11-25 08:47:50,251 INFO L444 ceAbstractionStarter]: For program point L4901-3(line 4901) no Hoare annotation was computed. [2019-11-25 08:47:50,251 INFO L444 ceAbstractionStarter]: For program point L4901(line 4901) no Hoare annotation was computed. [2019-11-25 08:47:50,251 INFO L444 ceAbstractionStarter]: For program point L4901-1(line 4901) no Hoare annotation was computed. [2019-11-25 08:47:50,251 INFO L440 ceAbstractionStarter]: At program point L4836(lines 4835 4882) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,251 INFO L440 ceAbstractionStarter]: At program point L3912(lines 3809 3961) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,252 INFO L444 ceAbstractionStarter]: For program point L4375(lines 4375 4378) no Hoare annotation was computed. [2019-11-25 08:47:50,252 INFO L440 ceAbstractionStarter]: At program point L4111-1(lines 4085 4112) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,252 INFO L440 ceAbstractionStarter]: At program point L4111(lines 4085 4112) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,252 INFO L444 ceAbstractionStarter]: For program point L4838(lines 4838 4882) no Hoare annotation was computed. [2019-11-25 08:47:50,252 INFO L440 ceAbstractionStarter]: At program point L3715-1(lines 3712 3717) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,252 INFO L440 ceAbstractionStarter]: At program point L3715(lines 3712 3717) the Hoare annotation is: (and (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0)) [2019-11-25 08:47:50,252 INFO L444 ceAbstractionStarter]: For program point L4178(lines 4178 4182) no Hoare annotation was computed. [2019-11-25 08:47:50,252 INFO L444 ceAbstractionStarter]: For program point L4178-2(lines 4178 4182) no Hoare annotation was computed. [2019-11-25 08:47:50,252 INFO L440 ceAbstractionStarter]: At program point L4839(lines 4838 4882) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,252 INFO L440 ceAbstractionStarter]: At program point L3650(lines 3644 3652) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,253 INFO L440 ceAbstractionStarter]: At program point L5104(lines 5103 5105) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,253 INFO L440 ceAbstractionStarter]: At program point L4114(lines 4054 4116) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,253 INFO L440 ceAbstractionStarter]: At program point L4114-1(lines 4054 4116) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,253 INFO L444 ceAbstractionStarter]: For program point L4379(lines 4379 4382) no Hoare annotation was computed. [2019-11-25 08:47:50,253 INFO L444 ceAbstractionStarter]: For program point L4379-2(lines 4379 4382) no Hoare annotation was computed. [2019-11-25 08:47:50,253 INFO L444 ceAbstractionStarter]: For program point L3917(line 3917) no Hoare annotation was computed. [2019-11-25 08:47:50,253 INFO L444 ceAbstractionStarter]: For program point L4578(lines 4578 4585) no Hoare annotation was computed. [2019-11-25 08:47:50,253 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:47:50,253 INFO L440 ceAbstractionStarter]: At program point L5107(lines 5106 5108) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,253 INFO L444 ceAbstractionStarter]: For program point L3918(lines 3918 3924) no Hoare annotation was computed. [2019-11-25 08:47:50,254 INFO L440 ceAbstractionStarter]: At program point L3852(lines 3809 3961) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,254 INFO L444 ceAbstractionStarter]: For program point L4183(lines 4183 4187) no Hoare annotation was computed. [2019-11-25 08:47:50,254 INFO L444 ceAbstractionStarter]: For program point L4183-2(lines 4183 4187) no Hoare annotation was computed. [2019-11-25 08:47:50,254 INFO L440 ceAbstractionStarter]: At program point L4051(lines 3963 4053) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,254 INFO L447 ceAbstractionStarter]: At program point L4910(lines 4910 4911) the Hoare annotation is: true [2019-11-25 08:47:50,254 INFO L447 ceAbstractionStarter]: At program point L4910-1(lines 4910 4911) the Hoare annotation is: true [2019-11-25 08:47:50,254 INFO L440 ceAbstractionStarter]: At program point L3721-1(lines 3718 3723) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,254 INFO L440 ceAbstractionStarter]: At program point L3721(lines 3718 3723) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,255 INFO L440 ceAbstractionStarter]: At program point L3986loopEntry(lines 3986 3996) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,255 INFO L444 ceAbstractionStarter]: For program point L4383(lines 4383 4386) no Hoare annotation was computed. [2019-11-25 08:47:50,255 INFO L444 ceAbstractionStarter]: For program point L3987(line 3987) no Hoare annotation was computed. [2019-11-25 08:47:50,255 INFO L440 ceAbstractionStarter]: At program point L5111(lines 5110 5112) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,255 INFO L444 ceAbstractionStarter]: For program point L3988(lines 3988 3994) no Hoare annotation was computed. [2019-11-25 08:47:50,255 INFO L440 ceAbstractionStarter]: At program point L4583(lines 4456 4599) the Hoare annotation is: (and (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0) (= 0 ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base) (<= 1 ~ldv_urb_state~0)) [2019-11-25 08:47:50,255 INFO L440 ceAbstractionStarter]: At program point L4253(lines 4223 4255) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,255 INFO L444 ceAbstractionStarter]: For program point L3857(line 3857) no Hoare annotation was computed. [2019-11-25 08:47:50,256 INFO L440 ceAbstractionStarter]: At program point L4981loopEntry(lines 4981 4994) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,256 INFO L444 ceAbstractionStarter]: For program point L3858(lines 3858 3864) no Hoare annotation was computed. [2019-11-25 08:47:50,256 INFO L440 ceAbstractionStarter]: At program point L5114(lines 5113 5115) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,256 INFO L444 ceAbstractionStarter]: For program point L4057-1(lines 4057 4113) no Hoare annotation was computed. [2019-11-25 08:47:50,256 INFO L444 ceAbstractionStarter]: For program point L4057(lines 4057 4113) no Hoare annotation was computed. [2019-11-25 08:47:50,256 INFO L444 ceAbstractionStarter]: For program point L4982(line 4982) no Hoare annotation was computed. [2019-11-25 08:47:50,256 INFO L440 ceAbstractionStarter]: At program point L4322loopEntry(lines 4322 4337) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,256 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:47:50,256 INFO L440 ceAbstractionStarter]: At program point L4058(lines 4057 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,257 INFO L440 ceAbstractionStarter]: At program point L4058-1(lines 4057 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,257 INFO L444 ceAbstractionStarter]: For program point L4323(lines 4322 4337) no Hoare annotation was computed. [2019-11-25 08:47:50,257 INFO L440 ceAbstractionStarter]: At program point L3927(lines 3809 3961) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,257 INFO L444 ceAbstractionStarter]: For program point L4390(lines 4390 4393) no Hoare annotation was computed. [2019-11-25 08:47:50,257 INFO L444 ceAbstractionStarter]: For program point L4060(lines 4060 4113) no Hoare annotation was computed. [2019-11-25 08:47:50,257 INFO L444 ceAbstractionStarter]: For program point L4060-1(lines 4060 4113) no Hoare annotation was computed. [2019-11-25 08:47:50,257 INFO L440 ceAbstractionStarter]: At program point L4259(lines 4117 4261) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,257 INFO L440 ceAbstractionStarter]: At program point L5118(lines 5117 5119) the Hoare annotation is: (and (= 0 (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|)) (= ~ir_add_bof~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0)) [2019-11-25 08:47:50,258 INFO L440 ceAbstractionStarter]: At program point L4458loopEntry(lines 4458 4468) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,258 INFO L444 ceAbstractionStarter]: For program point L4326(line 4326) no Hoare annotation was computed. [2019-11-25 08:47:50,258 INFO L444 ceAbstractionStarter]: For program point L4987(lines 4987 4990) no Hoare annotation was computed. [2019-11-25 08:47:50,258 INFO L440 ceAbstractionStarter]: At program point L5053(lines 5052 5054) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,258 INFO L444 ceAbstractionStarter]: For program point L4459(line 4459) no Hoare annotation was computed. [2019-11-25 08:47:50,258 INFO L444 ceAbstractionStarter]: For program point L4063-1(lines 4063 4113) no Hoare annotation was computed. [2019-11-25 08:47:50,258 INFO L444 ceAbstractionStarter]: For program point L4063(lines 4063 4113) no Hoare annotation was computed. [2019-11-25 08:47:50,258 INFO L440 ceAbstractionStarter]: At program point L3997(lines 3970 4052) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,258 INFO L444 ceAbstractionStarter]: For program point L4460(lines 4460 4466) no Hoare annotation was computed. [2019-11-25 08:47:50,258 INFO L440 ceAbstractionStarter]: At program point L4064(lines 4060 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,259 INFO L440 ceAbstractionStarter]: At program point L5121(lines 1 5138) the Hoare annotation is: (and (= 0 (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|)) (= ~ir_add_bof~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (or (<= (+ ULTIMATE.start_ir_init_~retval~0 1) 0) (< 0 ULTIMATE.start_ir_init_~retval~0)) (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0)) [2019-11-25 08:47:50,259 INFO L440 ceAbstractionStarter]: At program point L4064-1(lines 4060 4113) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,259 INFO L440 ceAbstractionStarter]: At program point L5121-1(lines 5036 5041) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,259 INFO L444 ceAbstractionStarter]: For program point L3932(line 3932) no Hoare annotation was computed. [2019-11-25 08:47:50,259 INFO L440 ceAbstractionStarter]: At program point L4197(lines 4139 4198) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-25 08:47:50,277 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,278 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,278 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,279 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,279 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,279 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,281 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,281 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,281 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,282 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,282 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,282 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,283 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,284 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,284 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,284 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,285 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,285 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,286 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,286 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,286 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,287 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,287 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,287 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,288 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,288 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,288 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,289 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,289 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,289 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,290 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,290 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,291 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,291 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,291 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,292 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,295 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,295 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,296 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,296 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,296 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,297 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:47:50 BoogieIcfgContainer [2019-11-25 08:47:50,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:47:50,308 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:47:50,308 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:47:50,308 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:47:50,308 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:37" (3/4) ... [2019-11-25 08:47:50,311 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:47:50,342 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 132 nodes and edges [2019-11-25 08:47:50,345 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 64 nodes and edges [2019-11-25 08:47:50,348 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2019-11-25 08:47:50,351 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-25 08:47:50,353 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-25 08:47:50,356 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:47:50,359 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 08:47:50,362 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 08:47:50,407 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\result == 0 && !(\result == 0)) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && \result == 0) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) || (((((\result == 0 && 0 == ldv_coherent_state) && \result == 0) && \result == 0) && ldv_urb_state == 0) && 0 == arbitrary_memory) [2019-11-25 08:47:50,407 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && 0 == ldv_coherent_state) && ldv_urb_state == 0 [2019-11-25 08:47:50,408 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && 0 == urb) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && \result == 0) && 0 == arbitrary_memory) && 1 <= ldv_urb_state [2019-11-25 08:47:50,408 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && 0 == urb) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && \result == 0) && 0 == arbitrary_memory) && 1 <= ldv_urb_state [2019-11-25 08:47:50,409 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && 0 == urb) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && \result == 0) && 0 == arbitrary_memory) && 1 <= ldv_urb_state [2019-11-25 08:47:50,409 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((urb == 0 && \result == 0) && 0 == urb) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && \result == 0) && 0 == arbitrary_memory) && 1 <= ldv_urb_state [2019-11-25 08:47:50,410 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && 0 == urb) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && \result == 0) && 0 == arbitrary_memory) && 1 <= ldv_urb_state [2019-11-25 08:47:50,411 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && 0 == urb) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && \result == 0) && 0 == arbitrary_memory) && 1 <= ldv_urb_state [2019-11-25 08:47:50,411 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && 0 == urb) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && \result == 0) && 0 == arbitrary_memory) && 1 <= ldv_urb_state [2019-11-25 08:47:50,411 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && 0 == urb) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && \result == 0) && 0 == arbitrary_memory) && 1 <= ldv_urb_state [2019-11-25 08:47:50,411 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((urb == 0 && \result == 0) && 0 == urb) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && \result == 0) && 0 == arbitrary_memory) && 1 <= ldv_urb_state [2019-11-25 08:47:50,693 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c97362a6-1d8c-4c40-951b-b1d098d88dbc/bin/uautomizer/witness.graphml [2019-11-25 08:47:50,694 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:47:50,696 INFO L168 Benchmark]: Toolchain (without parser) took 18441.85 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 737.7 MB). Free memory was 932.6 MB in the beginning and 1.4 GB in the end (delta: -425.0 MB). Peak memory consumption was 312.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:50,696 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:47:50,697 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1340.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -134.2 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:50,697 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.71 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: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:50,697 INFO L168 Benchmark]: Boogie Preprocessor took 137.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:50,698 INFO L168 Benchmark]: RCFGBuilder took 4060.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 199.2 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -206.1 MB). Peak memory consumption was 307.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:50,698 INFO L168 Benchmark]: TraceAbstraction took 12382.37 ms. Allocated memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: 375.4 MB). Free memory was 1.3 GB in the beginning and 1.5 GB in the end (delta: -264.2 MB). Peak memory consumption was 567.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:50,699 INFO L168 Benchmark]: Witness Printer took 386.14 ms. Allocated memory is still 1.8 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 160.1 MB). Peak memory consumption was 160.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:50,701 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1340.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -134.2 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 130.71 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: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 137.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4060.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 199.2 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -206.1 MB). Peak memory consumption was 307.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12382.37 ms. Allocated memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: 375.4 MB). Free memory was 1.3 GB in the beginning and 1.5 GB in the end (delta: -264.2 MB). Peak memory consumption was 567.7 MB. Max. memory is 11.5 GB. * Witness Printer took 386.14 ms. Allocated memory is still 1.8 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 160.1 MB). Peak memory consumption was 160.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4901]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4901]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4901]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4901]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 4215]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3712]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3809]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5006]: Loop Invariant Derived loop invariant: ((((((urb == 0 && \result == 0) && 0 == urb) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && \result == 0) && 0 == arbitrary_memory) && 1 <= ldv_urb_state - InvariantResult [Line: 4493]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3712]: Loop Invariant Derived loop invariant: (((((\result == 0 && 0 == urb) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && \result == 0) && 0 == arbitrary_memory) && 1 <= ldv_urb_state - InvariantResult [Line: 5006]: Loop Invariant Derived loop invariant: ((((((urb == 0 && \result == 0) && 0 == urb) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && \result == 0) && 0 == arbitrary_memory) && 1 <= ldv_urb_state - InvariantResult [Line: 4054]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3970]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4066]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4026]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5093]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4054]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4826]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4066]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4503]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5079]: Loop Invariant Derived loop invariant: (\result == 0 && 0 == ldv_coherent_state) && ldv_urb_state == 0 - InvariantResult [Line: 3809]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4085]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3811]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4457]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4212]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3807]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4458]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4981]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4490]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4501]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4487]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4209]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4603]: Loop Invariant [2019-11-25 08:47:50,712 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,712 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,712 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,712 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,712 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,713 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((0 == unknown-#memory_int-unknown[debug][debug] && ir_add_bof == 0) && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && 0 == unknown-#memory_int-unknown[xbof][xbof] + 1) && 0 == ldv_coherent_state) && ldv_urb_state == 0 - InvariantResult [Line: 4085]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3633]: Loop Invariant Derived loop invariant: (((((\result == 0 && 0 == urb) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && \result == 0) && 0 == arbitrary_memory) && 1 <= ldv_urb_state - InvariantResult [Line: 3618]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3633]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3678]: Loop Invariant [2019-11-25 08:47:50,714 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,714 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,714 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,714 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,714 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,715 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((0 == unknown-#memory_int-unknown[debug][debug] && ir_add_bof == 0) && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && unknown-#memory_int-unknown[xbof][xbof] + 1 == 0 - InvariantResult [Line: 5033]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4060]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5036]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4060]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5076]: Loop Invariant [2019-11-25 08:47:50,715 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,716 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,716 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,716 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,716 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,716 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((0 == unknown-#memory_int-unknown[debug][debug] && ir_add_bof == 0) && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && unknown-#memory_int-unknown[xbof][xbof] + 1 == 0 - InvariantResult [Line: 4262]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3809]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 1]: Loop Invariant [2019-11-25 08:47:50,717 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,717 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,717 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,718 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,718 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,718 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((0 == unknown-#memory_int-unknown[debug][debug] && ir_add_bof == 0) && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && (retval + 1 <= 0 || 0 < retval)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && unknown-#memory_int-unknown[xbof][xbof] + 1 == 0 - InvariantResult [Line: 4849]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5117]: Loop Invariant [2019-11-25 08:47:50,719 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,719 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,719 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,719 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,720 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,720 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((0 == unknown-#memory_int-unknown[debug][debug] && ir_add_bof == 0) && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && unknown-#memory_int-unknown[xbof][xbof] + 1 == 0 - InvariantResult [Line: 5106]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4811]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5128]: Loop Invariant [2019-11-25 08:47:50,720 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,720 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,721 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,721 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,721 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,721 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((0 == unknown-#memory_int-unknown[debug][debug] && ir_add_bof == 0) && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && unknown-#memory_int-unknown[xbof][xbof] + 1 == 0 - InvariantResult [Line: 4484]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4206]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4481]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4057]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5059]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4282]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4117]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5059]: Loop Invariant Derived loop invariant: (((((\result == 0 && 0 == urb) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && \result == 0) && 0 == arbitrary_memory) && 1 <= ldv_urb_state - InvariantResult [Line: 4788]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3809]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4203]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3809]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4200]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3688]: Loop Invariant Derived loop invariant: (((((\result == 0 && 0 == urb) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && \result == 0) && 0 == arbitrary_memory) && 1 <= ldv_urb_state - InvariantResult [Line: 5103]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4057]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5089]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4322]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4605]: Loop Invariant [2019-11-25 08:47:50,724 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,724 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,724 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,724 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,725 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:50,725 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((0 == unknown-#memory_int-unknown[debug][debug] && ir_add_bof == 0) && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && (retval + 1 <= 0 || 0 < retval)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && unknown-#memory_int-unknown[xbof][xbof] + 1 == 0 - InvariantResult [Line: 4478]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4267]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4266]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5056]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3970]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4223]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3986]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4475]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3809]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3644]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4283]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5097]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5086]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4140]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3809]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4838]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4456]: Loop Invariant Derived loop invariant: (((((\result == 0 && 0 == urb) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && \result == 0) && 0 == arbitrary_memory) && 1 <= ldv_urb_state - InvariantResult [Line: 4321]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4081]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3614]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4081]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4002]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4835]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4078]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3718]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3718]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4499]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4221]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5113]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4078]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((\result == 0 && 0 == urb) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && \result == 0) && 0 == arbitrary_memory) && 1 <= ldv_urb_state - InvariantResult [Line: 4812]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5124]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3809]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3608]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4301]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5110]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5132]: Loop Invariant Derived loop invariant: (((((\result == 0 && 0 == urb) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && \result == 0) && 0 == arbitrary_memory) && 1 <= ldv_urb_state - InvariantResult [Line: 4910]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3809]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4910]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4075]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4075]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4832]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4072]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5063]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5052]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4829]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4072]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4083]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3963]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4083]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4139]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3667]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4496]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4976]: Loop Invariant Derived loop invariant: ((((((\result == 0 && !(\result == 0)) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && \result == 0) && 0 == arbitrary_memory) && 1 <= ldv_urb_state) || (((((\result == 0 && 0 == ldv_coherent_state) && \result == 0) && \result == 0) && ldv_urb_state == 0) && 0 == arbitrary_memory) - InvariantResult [Line: 4218]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 271 locations, 4 error locations. Result: SAFE, OverallTime: 12.2s, OverallIterations: 12, TraceHistogramMax: 2, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.6s, HoareTripleCheckerStatistics: 6087 SDtfs, 6837 SDslu, 9824 SDs, 0 SdLazy, 634 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2461occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 4119 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 124 LocationsWithAnnotation, 124 PreInvPairs, 858 NumberOfFragments, 1224 HoareAnnotationTreeSize, 124 FomulaSimplifications, 174238 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 124 FomulaSimplificationsInter, 546 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 523 NumberOfCodeBlocks, 523 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 511 ConstructedInterpolants, 0 QuantifiedInterpolants, 65879 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 15/15 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...