./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_07bb38f3-0f08-4f5d-b1f7-786922a06892/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_07bb38f3-0f08-4f5d-b1f7-786922a06892/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_07bb38f3-0f08-4f5d-b1f7-786922a06892/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_07bb38f3-0f08-4f5d-b1f7-786922a06892/bin/utaipan/config/TaipanReach.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/working_dir_07bb38f3-0f08-4f5d-b1f7-786922a06892/bin/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_07bb38f3-0f08-4f5d-b1f7-786922a06892/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1878e01b767e6e751a367f4dffe6089a256b4c0e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:27:11,664 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:27:11,665 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:27:11,677 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:27:11,678 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:27:11,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:27:11,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:27:11,681 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:27:11,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:27:11,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:27:11,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:27:11,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:27:11,685 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:27:11,686 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:27:11,686 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:27:11,687 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:27:11,688 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:27:11,688 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:27:11,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:27:11,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:27:11,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:27:11,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:27:11,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:27:11,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:27:11,696 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:27:11,696 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:27:11,696 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:27:11,697 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:27:11,697 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:27:11,698 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:27:11,698 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:27:11,699 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:27:11,699 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:27:11,700 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:27:11,701 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:27:11,701 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:27:11,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:27:11,702 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:27:11,702 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:27:11,702 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:27:11,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:27:11,704 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_07bb38f3-0f08-4f5d-b1f7-786922a06892/bin/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf [2019-10-22 11:27:11,714 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:27:11,714 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:27:11,715 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:27:11,715 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:27:11,715 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:27:11,716 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:27:11,716 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:27:11,716 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:27:11,716 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:27:11,716 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:27:11,717 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:27:11,717 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:27:11,717 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:27:11,718 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:27:11,718 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:27:11,718 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:27:11,718 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:27:11,718 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:27:11,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:27:11,719 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:27:11,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:27:11,719 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:27:11,719 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:27:11,719 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:27:11,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:27:11,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:27:11,720 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:27:11,720 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:27:11,720 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:27:11,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:27:11,721 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:27:11,721 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:27:11,721 INFO L138 SettingsManager]: * To the following directory=dump/ [2019-10-22 11:27:11,721 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_07bb38f3-0f08-4f5d-b1f7-786922a06892/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1878e01b767e6e751a367f4dffe6089a256b4c0e [2019-10-22 11:27:11,760 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:27:11,774 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:27:11,781 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:27:11,783 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:27:11,784 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:27:11,784 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_07bb38f3-0f08-4f5d-b1f7-786922a06892/bin/utaipan/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2019-10-22 11:27:11,829 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_07bb38f3-0f08-4f5d-b1f7-786922a06892/bin/utaipan/data/c40268830/5dabec3ded2344e88223c3001733fc39/FLAG7e0c9c478 [2019-10-22 11:27:12,373 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:27:12,374 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_07bb38f3-0f08-4f5d-b1f7-786922a06892/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2019-10-22 11:27:12,405 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_07bb38f3-0f08-4f5d-b1f7-786922a06892/bin/utaipan/data/c40268830/5dabec3ded2344e88223c3001733fc39/FLAG7e0c9c478 [2019-10-22 11:27:12,852 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_07bb38f3-0f08-4f5d-b1f7-786922a06892/bin/utaipan/data/c40268830/5dabec3ded2344e88223c3001733fc39 [2019-10-22 11:27:12,854 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:27:12,855 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:27:12,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:27:12,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:27:12,863 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:27:12,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:27:12" (1/1) ... [2019-10-22 11:27:12,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d6daf3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:12, skipping insertion in model container [2019-10-22 11:27:12,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:27:12" (1/1) ... [2019-10-22 11:27:12,872 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:27:12,972 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:27:13,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:27:13,928 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:27:14,062 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:27:14,130 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:27:14,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:14 WrapperNode [2019-10-22 11:27:14,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:27:14,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:27:14,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:27:14,133 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:27:14,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:14" (1/1) ... [2019-10-22 11:27:14,176 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:14" (1/1) ... [2019-10-22 11:27:14,270 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:27:14,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:27:14,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:27:14,271 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:27:14,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:14" (1/1) ... [2019-10-22 11:27:14,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:14" (1/1) ... [2019-10-22 11:27:14,293 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:14" (1/1) ... [2019-10-22 11:27:14,295 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:14" (1/1) ... [2019-10-22 11:27:14,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:14" (1/1) ... [2019-10-22 11:27:14,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:14" (1/1) ... [2019-10-22 11:27:14,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:14" (1/1) ... [2019-10-22 11:27:14,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:27:14,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:27:14,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:27:14,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:27:14,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_07bb38f3-0f08-4f5d-b1f7-786922a06892/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:27:14,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:27:14,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:27:14,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:27:14,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:27:14,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:27:14,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 11:27:14,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:27:14,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:27:14,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:27:14,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:27:14,938 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:27:14,947 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:27:14,950 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:27:14,956 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:27:14,976 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:27:17,421 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##81: assume !false; [2019-10-22 11:27:17,421 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##80: assume false; [2019-10-22 11:27:17,422 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume !false; [2019-10-22 11:27:17,422 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume false; [2019-10-22 11:27:17,422 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##334: assume !false; [2019-10-22 11:27:17,422 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##333: assume false; [2019-10-22 11:27:17,422 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##104: assume !false; [2019-10-22 11:27:17,422 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##103: assume false; [2019-10-22 11:27:17,422 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##125: assume !false; [2019-10-22 11:27:17,423 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##124: assume false; [2019-10-22 11:27:17,424 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:27:17,424 INFO L284 CfgBuilder]: Removed 156 assume(true) statements. [2019-10-22 11:27:17,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:17 BoogieIcfgContainer [2019-10-22 11:27:17,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:27:17,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:27:17,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:27:17,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:27:17,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:27:12" (1/3) ... [2019-10-22 11:27:17,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f99a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:27:17, skipping insertion in model container [2019-10-22 11:27:17,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:14" (2/3) ... [2019-10-22 11:27:17,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f99a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:27:17, skipping insertion in model container [2019-10-22 11:27:17,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:17" (3/3) ... [2019-10-22 11:27:17,432 INFO L109 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2019-10-22 11:27:17,441 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:27:17,448 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-10-22 11:27:17,458 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-10-22 11:27:17,479 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:27:17,480 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:27:17,480 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:27:17,480 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:27:17,480 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:27:17,480 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:27:17,480 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:27:17,480 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:27:17,497 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states. [2019-10-22 11:27:17,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:27:17,503 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:17,504 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:17,505 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:17,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:17,510 INFO L82 PathProgramCache]: Analyzing trace with hash 986721245, now seen corresponding path program 1 times [2019-10-22 11:27:17,519 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:17,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655953822] [2019-10-22 11:27:17,519 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:17,519 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:17,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:17,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:17,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655953822] [2019-10-22 11:27:17,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:17,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:17,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326291803] [2019-10-22 11:27:17,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:17,983 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:17,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:17,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:17,998 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 4 states. [2019-10-22 11:27:18,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:18,353 INFO L93 Difference]: Finished difference Result 776 states and 1190 transitions. [2019-10-22 11:27:18,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:18,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-22 11:27:18,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:18,369 INFO L225 Difference]: With dead ends: 776 [2019-10-22 11:27:18,369 INFO L226 Difference]: Without dead ends: 494 [2019-10-22 11:27:18,372 INFO L600 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-10-22 11:27:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-10-22 11:27:18,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 268. [2019-10-22 11:27:18,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-10-22 11:27:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 357 transitions. [2019-10-22 11:27:18,421 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 357 transitions. Word has length 12 [2019-10-22 11:27:18,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:18,421 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 357 transitions. [2019-10-22 11:27:18,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:18,422 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 357 transitions. [2019-10-22 11:27:18,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:27:18,422 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:18,422 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:18,423 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:18,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:18,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1666779615, now seen corresponding path program 1 times [2019-10-22 11:27:18,423 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:18,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297647880] [2019-10-22 11:27:18,423 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:18,424 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:18,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:18,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:18,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297647880] [2019-10-22 11:27:18,568 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:18,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:27:18,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104039409] [2019-10-22 11:27:18,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:27:18,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:18,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:27:18,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:18,570 INFO L87 Difference]: Start difference. First operand 268 states and 357 transitions. Second operand 3 states. [2019-10-22 11:27:18,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:18,619 INFO L93 Difference]: Finished difference Result 769 states and 1032 transitions. [2019-10-22 11:27:18,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:27:18,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-22 11:27:18,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:18,625 INFO L225 Difference]: With dead ends: 769 [2019-10-22 11:27:18,625 INFO L226 Difference]: Without dead ends: 515 [2019-10-22 11:27:18,627 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:18,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-10-22 11:27:18,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 511. [2019-10-22 11:27:18,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-10-22 11:27:18,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 687 transitions. [2019-10-22 11:27:18,654 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 687 transitions. Word has length 12 [2019-10-22 11:27:18,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:18,655 INFO L462 AbstractCegarLoop]: Abstraction has 511 states and 687 transitions. [2019-10-22 11:27:18,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:27:18,655 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 687 transitions. [2019-10-22 11:27:18,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:27:18,655 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:18,655 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:18,656 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:18,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:18,656 INFO L82 PathProgramCache]: Analyzing trace with hash 130559946, now seen corresponding path program 1 times [2019-10-22 11:27:18,656 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:18,656 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458181740] [2019-10-22 11:27:18,657 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:18,657 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:18,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:18,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:18,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458181740] [2019-10-22 11:27:18,782 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:18,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:27:18,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424538648] [2019-10-22 11:27:18,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:27:18,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:18,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:27:18,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:18,783 INFO L87 Difference]: Start difference. First operand 511 states and 687 transitions. Second operand 3 states. [2019-10-22 11:27:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:18,799 INFO L93 Difference]: Finished difference Result 511 states and 687 transitions. [2019-10-22 11:27:18,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:27:18,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-22 11:27:18,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:18,801 INFO L225 Difference]: With dead ends: 511 [2019-10-22 11:27:18,802 INFO L226 Difference]: Without dead ends: 505 [2019-10-22 11:27:18,802 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:18,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-10-22 11:27:18,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2019-10-22 11:27:18,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-10-22 11:27:18,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 678 transitions. [2019-10-22 11:27:18,855 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 678 transitions. Word has length 13 [2019-10-22 11:27:18,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:18,858 INFO L462 AbstractCegarLoop]: Abstraction has 505 states and 678 transitions. [2019-10-22 11:27:18,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:27:18,858 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 678 transitions. [2019-10-22 11:27:18,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-22 11:27:18,860 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:18,860 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:18,860 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:18,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:18,861 INFO L82 PathProgramCache]: Analyzing trace with hash -946322374, now seen corresponding path program 1 times [2019-10-22 11:27:18,861 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:18,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177655375] [2019-10-22 11:27:18,862 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:18,862 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:18,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:19,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177655375] [2019-10-22 11:27:19,000 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:19,000 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:19,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004465004] [2019-10-22 11:27:19,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:19,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:19,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:19,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:19,003 INFO L87 Difference]: Start difference. First operand 505 states and 678 transitions. Second operand 4 states. [2019-10-22 11:27:19,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:19,294 INFO L93 Difference]: Finished difference Result 1434 states and 1943 transitions. [2019-10-22 11:27:19,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:19,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-10-22 11:27:19,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:19,300 INFO L225 Difference]: With dead ends: 1434 [2019-10-22 11:27:19,300 INFO L226 Difference]: Without dead ends: 943 [2019-10-22 11:27:19,302 INFO L600 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-10-22 11:27:19,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-10-22 11:27:19,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 931. [2019-10-22 11:27:19,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-10-22 11:27:19,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1269 transitions. [2019-10-22 11:27:19,347 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1269 transitions. Word has length 48 [2019-10-22 11:27:19,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:19,348 INFO L462 AbstractCegarLoop]: Abstraction has 931 states and 1269 transitions. [2019-10-22 11:27:19,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:19,348 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1269 transitions. [2019-10-22 11:27:19,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-22 11:27:19,350 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:19,350 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:19,350 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:19,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:19,351 INFO L82 PathProgramCache]: Analyzing trace with hash 439881020, now seen corresponding path program 1 times [2019-10-22 11:27:19,351 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:19,351 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963309488] [2019-10-22 11:27:19,351 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:19,351 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:19,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:19,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:19,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963309488] [2019-10-22 11:27:19,619 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:19,619 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:19,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055736524] [2019-10-22 11:27:19,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:19,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:19,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:19,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:19,620 INFO L87 Difference]: Start difference. First operand 931 states and 1269 transitions. Second operand 4 states. [2019-10-22 11:27:19,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:19,833 INFO L93 Difference]: Finished difference Result 2412 states and 3289 transitions. [2019-10-22 11:27:19,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:27:19,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-10-22 11:27:19,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:19,840 INFO L225 Difference]: With dead ends: 2412 [2019-10-22 11:27:19,840 INFO L226 Difference]: Without dead ends: 1947 [2019-10-22 11:27:19,841 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:19,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2019-10-22 11:27:19,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 935. [2019-10-22 11:27:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-10-22 11:27:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1273 transitions. [2019-10-22 11:27:19,886 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1273 transitions. Word has length 48 [2019-10-22 11:27:19,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:19,886 INFO L462 AbstractCegarLoop]: Abstraction has 935 states and 1273 transitions. [2019-10-22 11:27:19,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:19,887 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1273 transitions. [2019-10-22 11:27:19,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-22 11:27:19,888 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:19,889 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:19,889 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:19,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:19,889 INFO L82 PathProgramCache]: Analyzing trace with hash -502576155, now seen corresponding path program 1 times [2019-10-22 11:27:19,889 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:19,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564877252] [2019-10-22 11:27:19,890 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:19,890 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:19,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:20,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:20,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564877252] [2019-10-22 11:27:20,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:20,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:20,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660112297] [2019-10-22 11:27:20,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:20,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:20,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:20,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:20,012 INFO L87 Difference]: Start difference. First operand 935 states and 1273 transitions. Second operand 4 states. [2019-10-22 11:27:20,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:20,141 INFO L93 Difference]: Finished difference Result 2659 states and 3642 transitions. [2019-10-22 11:27:20,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:20,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-10-22 11:27:20,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:20,147 INFO L225 Difference]: With dead ends: 2659 [2019-10-22 11:27:20,147 INFO L226 Difference]: Without dead ends: 1738 [2019-10-22 11:27:20,149 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:20,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-10-22 11:27:20,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 909. [2019-10-22 11:27:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-10-22 11:27:20,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1237 transitions. [2019-10-22 11:27:20,198 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1237 transitions. Word has length 50 [2019-10-22 11:27:20,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:20,198 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1237 transitions. [2019-10-22 11:27:20,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:20,198 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1237 transitions. [2019-10-22 11:27:20,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-22 11:27:20,200 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:20,200 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:20,200 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:20,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:20,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1089382169, now seen corresponding path program 1 times [2019-10-22 11:27:20,201 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:20,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483135069] [2019-10-22 11:27:20,201 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:20,201 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:20,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:20,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:20,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483135069] [2019-10-22 11:27:20,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:20,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:20,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624918274] [2019-10-22 11:27:20,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:20,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:20,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:20,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:20,339 INFO L87 Difference]: Start difference. First operand 909 states and 1237 transitions. Second operand 4 states. [2019-10-22 11:27:20,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:20,620 INFO L93 Difference]: Finished difference Result 4079 states and 5556 transitions. [2019-10-22 11:27:20,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:27:20,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-10-22 11:27:20,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:20,633 INFO L225 Difference]: With dead ends: 4079 [2019-10-22 11:27:20,633 INFO L226 Difference]: Without dead ends: 3184 [2019-10-22 11:27:20,635 INFO L600 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-10-22 11:27:20,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3184 states. [2019-10-22 11:27:20,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3184 to 1735. [2019-10-22 11:27:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-10-22 11:27:20,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2356 transitions. [2019-10-22 11:27:20,823 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2356 transitions. Word has length 50 [2019-10-22 11:27:20,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:20,823 INFO L462 AbstractCegarLoop]: Abstraction has 1735 states and 2356 transitions. [2019-10-22 11:27:20,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:20,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2356 transitions. [2019-10-22 11:27:20,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-22 11:27:20,825 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:20,825 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:20,825 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:20,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:20,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1353156781, now seen corresponding path program 1 times [2019-10-22 11:27:20,826 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:20,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727832196] [2019-10-22 11:27:20,826 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:20,827 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:20,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:20,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727832196] [2019-10-22 11:27:20,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:20,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:20,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985325265] [2019-10-22 11:27:20,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:20,950 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:20,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:20,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:20,951 INFO L87 Difference]: Start difference. First operand 1735 states and 2356 transitions. Second operand 4 states. [2019-10-22 11:27:21,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:21,288 INFO L93 Difference]: Finished difference Result 3395 states and 4597 transitions. [2019-10-22 11:27:21,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:21,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-10-22 11:27:21,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:21,294 INFO L225 Difference]: With dead ends: 3395 [2019-10-22 11:27:21,295 INFO L226 Difference]: Without dead ends: 1674 [2019-10-22 11:27:21,297 INFO L600 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-10-22 11:27:21,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-10-22 11:27:21,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1659. [2019-10-22 11:27:21,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1659 states. [2019-10-22 11:27:21,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2240 transitions. [2019-10-22 11:27:21,387 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2240 transitions. Word has length 50 [2019-10-22 11:27:21,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:21,387 INFO L462 AbstractCegarLoop]: Abstraction has 1659 states and 2240 transitions. [2019-10-22 11:27:21,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:21,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2240 transitions. [2019-10-22 11:27:21,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-22 11:27:21,389 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:21,389 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:21,389 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:21,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:21,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1701579105, now seen corresponding path program 1 times [2019-10-22 11:27:21,389 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:21,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217705118] [2019-10-22 11:27:21,390 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:21,390 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:21,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:21,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:21,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217705118] [2019-10-22 11:27:21,527 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:21,528 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:21,528 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169087109] [2019-10-22 11:27:21,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:21,528 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:21,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:21,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:21,529 INFO L87 Difference]: Start difference. First operand 1659 states and 2240 transitions. Second operand 4 states. [2019-10-22 11:27:23,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:23,715 INFO L93 Difference]: Finished difference Result 2514 states and 3396 transitions. [2019-10-22 11:27:23,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:23,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-10-22 11:27:23,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:23,725 INFO L225 Difference]: With dead ends: 2514 [2019-10-22 11:27:23,725 INFO L226 Difference]: Without dead ends: 2510 [2019-10-22 11:27:23,726 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:23,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2510 states. [2019-10-22 11:27:23,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2510 to 2505. [2019-10-22 11:27:23,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2505 states. [2019-10-22 11:27:23,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3384 transitions. [2019-10-22 11:27:23,860 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 3384 transitions. Word has length 58 [2019-10-22 11:27:23,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:23,861 INFO L462 AbstractCegarLoop]: Abstraction has 2505 states and 3384 transitions. [2019-10-22 11:27:23,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:23,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3384 transitions. [2019-10-22 11:27:23,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-22 11:27:23,864 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:23,864 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:23,864 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:23,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:23,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1031851433, now seen corresponding path program 1 times [2019-10-22 11:27:23,865 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:23,865 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618882871] [2019-10-22 11:27:23,865 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:23,865 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:23,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:24,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:24,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618882871] [2019-10-22 11:27:24,041 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:24,041 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:24,041 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023278807] [2019-10-22 11:27:24,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:27:24,041 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:24,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:27:24,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:24,042 INFO L87 Difference]: Start difference. First operand 2505 states and 3384 transitions. Second operand 3 states. [2019-10-22 11:27:24,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:24,196 INFO L93 Difference]: Finished difference Result 3428 states and 4620 transitions. [2019-10-22 11:27:24,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:27:24,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-10-22 11:27:24,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:24,203 INFO L225 Difference]: With dead ends: 3428 [2019-10-22 11:27:24,204 INFO L226 Difference]: Without dead ends: 1721 [2019-10-22 11:27:24,206 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:24,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2019-10-22 11:27:24,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1721. [2019-10-22 11:27:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1721 states. [2019-10-22 11:27:24,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 2302 transitions. [2019-10-22 11:27:24,377 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 2302 transitions. Word has length 64 [2019-10-22 11:27:24,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:24,377 INFO L462 AbstractCegarLoop]: Abstraction has 1721 states and 2302 transitions. [2019-10-22 11:27:24,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:27:24,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2302 transitions. [2019-10-22 11:27:24,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-22 11:27:24,379 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:24,379 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:24,379 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:24,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:24,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1779804946, now seen corresponding path program 1 times [2019-10-22 11:27:24,380 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:24,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395124129] [2019-10-22 11:27:24,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:24,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:24,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 11:27:24,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395124129] [2019-10-22 11:27:24,563 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:24,564 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:27:24,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300747284] [2019-10-22 11:27:24,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:27:24,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:24,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:27:24,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:24,565 INFO L87 Difference]: Start difference. First operand 1721 states and 2302 transitions. Second operand 5 states. [2019-10-22 11:27:24,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:24,694 INFO L93 Difference]: Finished difference Result 3430 states and 4590 transitions. [2019-10-22 11:27:24,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:27:24,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-10-22 11:27:24,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:24,699 INFO L225 Difference]: With dead ends: 3430 [2019-10-22 11:27:24,699 INFO L226 Difference]: Without dead ends: 1719 [2019-10-22 11:27:24,702 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:27:24,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-10-22 11:27:24,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1719. [2019-10-22 11:27:24,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-10-22 11:27:24,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2298 transitions. [2019-10-22 11:27:24,787 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2298 transitions. Word has length 66 [2019-10-22 11:27:24,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:24,787 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2298 transitions. [2019-10-22 11:27:24,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:27:24,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2298 transitions. [2019-10-22 11:27:24,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-22 11:27:24,789 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:24,789 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:24,790 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:24,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:24,790 INFO L82 PathProgramCache]: Analyzing trace with hash 981368905, now seen corresponding path program 1 times [2019-10-22 11:27:24,790 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:24,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56220825] [2019-10-22 11:27:24,790 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:24,790 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:24,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:25,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 11:27:25,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56220825] [2019-10-22 11:27:25,004 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:25,004 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:25,004 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843768552] [2019-10-22 11:27:25,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:25,005 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:25,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:25,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:25,005 INFO L87 Difference]: Start difference. First operand 1719 states and 2298 transitions. Second operand 4 states. [2019-10-22 11:27:26,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:26,081 INFO L93 Difference]: Finished difference Result 1719 states and 2298 transitions. [2019-10-22 11:27:26,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:26,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-10-22 11:27:26,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:26,082 INFO L225 Difference]: With dead ends: 1719 [2019-10-22 11:27:26,082 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:27:26,084 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:26,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:27:26,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:27:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:27:26,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:27:26,085 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2019-10-22 11:27:26,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:26,085 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:27:26,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:26,085 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:27:26,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:27:26,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:27:27,878 INFO L443 ceAbstractionStarter]: For program point L4065-1(lines 4065 4112) no Hoare annotation was computed. [2019-10-22 11:27:27,878 INFO L443 ceAbstractionStarter]: For program point L4065(lines 4065 4112) no Hoare annotation was computed. [2019-10-22 11:27:27,879 INFO L439 ceAbstractionStarter]: At program point L5056(lines 5055 5057) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,879 INFO L439 ceAbstractionStarter]: At program point L5123(lines 1 5144) 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-10-22 11:27:27,879 INFO L439 ceAbstractionStarter]: At program point L5123-1(lines 5035 5040) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,879 INFO L443 ceAbstractionStarter]: For program point L4199(lines 4199 4254) no Hoare annotation was computed. [2019-10-22 11:27:27,879 INFO L439 ceAbstractionStarter]: At program point L4001loopEntry(lines 4001 4016) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,879 INFO L439 ceAbstractionStarter]: At program point L4266loopEntry(lines 4266 4276) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,879 INFO L439 ceAbstractionStarter]: At program point L4200(lines 4199 4254) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,879 INFO L443 ceAbstractionStarter]: For program point L4068(lines 4068 4112) no Hoare annotation was computed. [2019-10-22 11:27:27,879 INFO L443 ceAbstractionStarter]: For program point L4002(line 4002) no Hoare annotation was computed. [2019-10-22 11:27:27,879 INFO L443 ceAbstractionStarter]: For program point L4068-1(lines 4068 4112) no Hoare annotation was computed. [2019-10-22 11:27:27,879 INFO L443 ceAbstractionStarter]: For program point L4267(line 4267) no Hoare annotation was computed. [2019-10-22 11:27:27,879 INFO L439 ceAbstractionStarter]: At program point L4069-1(lines 4065 4112) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,879 INFO L439 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-10-22 11:27:27,879 INFO L439 ceAbstractionStarter]: At program point L4069(lines 4065 4112) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,880 INFO L443 ceAbstractionStarter]: For program point L4994(lines 4979 4995) no Hoare annotation was computed. [2019-10-22 11:27:27,880 INFO L439 ceAbstractionStarter]: At program point L5060(lines 5059 5061) the Hoare annotation is: (and (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base))) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (<= 1 ~ldv_urb_state~0)) [2019-10-22 11:27:27,880 INFO L443 ceAbstractionStarter]: For program point L4003(lines 4003 4014) no Hoare annotation was computed. [2019-10-22 11:27:27,880 INFO L443 ceAbstractionStarter]: For program point L3871(line 3871) no Hoare annotation was computed. [2019-10-22 11:27:27,880 INFO L439 ceAbstractionStarter]: At program point L3673(lines 3666 3675) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,880 INFO L443 ceAbstractionStarter]: For program point L4202(lines 4202 4254) no Hoare annotation was computed. [2019-10-22 11:27:27,880 INFO L443 ceAbstractionStarter]: For program point L4268(lines 4268 4274) no Hoare annotation was computed. [2019-10-22 11:27:27,880 INFO L439 ceAbstractionStarter]: At program point L5127(lines 5126 5128) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,880 INFO L443 ceAbstractionStarter]: For program point L4004(lines 4004 4008) no Hoare annotation was computed. [2019-10-22 11:27:27,880 INFO L443 ceAbstractionStarter]: For program point L4004-2(lines 4004 4008) no Hoare annotation was computed. [2019-10-22 11:27:27,880 INFO L443 ceAbstractionStarter]: For program point L3872(lines 3872 3878) no Hoare annotation was computed. [2019-10-22 11:27:27,880 INFO L439 ceAbstractionStarter]: At program point L4203(lines 4202 4254) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,880 INFO L443 ceAbstractionStarter]: For program point L4071-1(lines 4071 4112) no Hoare annotation was computed. [2019-10-22 11:27:27,881 INFO L443 ceAbstractionStarter]: For program point L4071(lines 4071 4112) no Hoare annotation was computed. [2019-10-22 11:27:27,881 INFO L439 ceAbstractionStarter]: At program point L4534(lines 4502 4535) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,881 INFO L439 ceAbstractionStarter]: At program point L4468(lines 4456 4469) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,881 INFO L439 ceAbstractionStarter]: At program point L4072(lines 4071 4112) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,881 INFO L439 ceAbstractionStarter]: At program point L4072-1(lines 4071 4112) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,881 INFO L439 ceAbstractionStarter]: At program point L4997(lines 4975 4999) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse2 (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0)) (.cse0 (= 0 ~ldv_coherent_state~0))) (or (and .cse0 .cse1 .cse2 (= ~ldv_urb_state~0 0)) (and (<= ~ldv_urb_state~0 1) (or (not .cse1) (not .cse2)) .cse0 (<= 1 ~ldv_urb_state~0)))) [2019-10-22 11:27:27,881 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4900) no Hoare annotation was computed. [2019-10-22 11:27:27,881 INFO L439 ceAbstractionStarter]: At program point L4337(lines 4320 4338) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,882 INFO L443 ceAbstractionStarter]: For program point L4205(lines 4205 4254) no Hoare annotation was computed. [2019-10-22 11:27:27,882 INFO L439 ceAbstractionStarter]: At program point L4139loopEntry(lines 4139 4195) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,882 INFO L439 ceAbstractionStarter]: At program point L5064(lines 5063 5065) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,882 INFO L439 ceAbstractionStarter]: At program point L3941(lines 3808 3960) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,882 INFO L439 ceAbstractionStarter]: At program point L3611(lines 3608 3613) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,882 INFO L439 ceAbstractionStarter]: At program point L4206(lines 4205 4254) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,882 INFO L439 ceAbstractionStarter]: At program point L5131(lines 5130 5132) 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-10-22 11:27:27,882 INFO L443 ceAbstractionStarter]: For program point L4140(line 4140) no Hoare annotation was computed. [2019-10-22 11:27:27,882 INFO L443 ceAbstractionStarter]: For program point L4074(lines 4074 4112) no Hoare annotation was computed. [2019-10-22 11:27:27,882 INFO L443 ceAbstractionStarter]: For program point L4074-1(lines 4074 4112) no Hoare annotation was computed. [2019-10-22 11:27:27,883 INFO L439 ceAbstractionStarter]: At program point L3810loopEntry(lines 3810 3820) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,883 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4900) no Hoare annotation was computed. [2019-10-22 11:27:27,883 INFO L443 ceAbstractionStarter]: For program point L4537-2(lines 4537 4545) no Hoare annotation was computed. [2019-10-22 11:27:27,883 INFO L443 ceAbstractionStarter]: For program point L4537(lines 4537 4545) no Hoare annotation was computed. [2019-10-22 11:27:27,883 INFO L443 ceAbstractionStarter]: For program point L4141(lines 4141 4193) no Hoare annotation was computed. [2019-10-22 11:27:27,883 INFO L439 ceAbstractionStarter]: At program point L4075-1(lines 4074 4112) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,883 INFO L439 ceAbstractionStarter]: At program point L4075(lines 4074 4112) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,883 INFO L443 ceAbstractionStarter]: For program point L3811(line 3811) no Hoare annotation was computed. [2019-10-22 11:27:27,883 INFO L443 ceAbstractionStarter]: For program point L4142(lines 4142 4146) no Hoare annotation was computed. [2019-10-22 11:27:27,883 INFO L443 ceAbstractionStarter]: For program point L4208(lines 4208 4254) no Hoare annotation was computed. [2019-10-22 11:27:27,883 INFO L443 ceAbstractionStarter]: For program point L4142-2(lines 4142 4146) no Hoare annotation was computed. [2019-10-22 11:27:27,884 INFO L443 ceAbstractionStarter]: For program point L3812(lines 3812 3818) no Hoare annotation was computed. [2019-10-22 11:27:27,884 INFO L443 ceAbstractionStarter]: For program point L4605-2(lines 4605 4609) no Hoare annotation was computed. [2019-10-22 11:27:27,884 INFO L443 ceAbstractionStarter]: For program point L4605(lines 4605 4609) no Hoare annotation was computed. [2019-10-22 11:27:27,884 INFO L439 ceAbstractionStarter]: At program point L4209(lines 4208 4254) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,884 INFO L443 ceAbstractionStarter]: For program point L4077-1(lines 4077 4112) no Hoare annotation was computed. [2019-10-22 11:27:27,884 INFO L443 ceAbstractionStarter]: For program point L4077(lines 4077 4112) no Hoare annotation was computed. [2019-10-22 11:27:27,884 INFO L443 ceAbstractionStarter]: For program point L4474(lines 4474 4536) no Hoare annotation was computed. [2019-10-22 11:27:27,884 INFO L439 ceAbstractionStarter]: At program point L5135(lines 5134 5136) the Hoare annotation is: (and (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base))) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (<= 1 ~ldv_urb_state~0)) [2019-10-22 11:27:27,884 INFO L439 ceAbstractionStarter]: At program point L4078(lines 4077 4112) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,884 INFO L439 ceAbstractionStarter]: At program point L4078-1(lines 4077 4112) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,884 INFO L443 ceAbstractionStarter]: For program point L3946(line 3946) no Hoare annotation was computed. [2019-10-22 11:27:27,885 INFO L443 ceAbstractionStarter]: For program point L4805(lines 4805 4808) no Hoare annotation was computed. [2019-10-22 11:27:27,885 INFO L439 ceAbstractionStarter]: At program point L4475(lines 4474 4536) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,885 INFO L443 ceAbstractionStarter]: For program point L4211(lines 4211 4254) no Hoare annotation was computed. [2019-10-22 11:27:27,885 INFO L439 ceAbstractionStarter]: At program point L4277(lines 4265 4278) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,885 INFO L443 ceAbstractionStarter]: For program point L3947(lines 3947 3953) no Hoare annotation was computed. [2019-10-22 11:27:27,885 INFO L439 ceAbstractionStarter]: At program point L3881(lines 3808 3960) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,885 INFO L439 ceAbstractionStarter]: At program point L3683(lines 3677 3685) 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-10-22 11:27:27,885 INFO L439 ceAbstractionStarter]: At program point L4212(lines 4211 4254) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,885 INFO L443 ceAbstractionStarter]: For program point L4080(lines 4080 4112) no Hoare annotation was computed. [2019-10-22 11:27:27,885 INFO L443 ceAbstractionStarter]: For program point L4080-1(lines 4080 4112) no Hoare annotation was computed. [2019-10-22 11:27:27,886 INFO L439 ceAbstractionStarter]: At program point L5005-2loopEntry(lines 5005 5024) the Hoare annotation is: (and (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base))) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (<= 1 ~ldv_urb_state~0)) [2019-10-22 11:27:27,886 INFO L439 ceAbstractionStarter]: At program point L5005loopEntry(lines 5005 5024) the Hoare annotation is: (and (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base))) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (<= 1 ~ldv_urb_state~0)) [2019-10-22 11:27:27,886 INFO L439 ceAbstractionStarter]: At program point L3618loopEntry(lines 3618 3624) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,886 INFO L443 ceAbstractionStarter]: For program point L4477(lines 4477 4536) no Hoare annotation was computed. [2019-10-22 11:27:27,886 INFO L443 ceAbstractionStarter]: For program point L4345-2(lines 4345 4355) no Hoare annotation was computed. [2019-10-22 11:27:27,886 INFO L443 ceAbstractionStarter]: For program point L4345(lines 4345 4355) no Hoare annotation was computed. [2019-10-22 11:27:27,886 INFO L443 ceAbstractionStarter]: For program point L4147(lines 4147 4151) no Hoare annotation was computed. [2019-10-22 11:27:27,886 INFO L439 ceAbstractionStarter]: At program point L4081-1(lines 4080 4112) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,886 INFO L439 ceAbstractionStarter]: At program point L4081(lines 4080 4112) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,886 INFO L443 ceAbstractionStarter]: For program point L5006(lines 5005 5024) no Hoare annotation was computed. [2019-10-22 11:27:27,887 INFO L443 ceAbstractionStarter]: For program point L4147-2(lines 4147 4151) no Hoare annotation was computed. [2019-10-22 11:27:27,887 INFO L443 ceAbstractionStarter]: For program point L5006-1(lines 5005 5024) no Hoare annotation was computed. [2019-10-22 11:27:27,887 INFO L443 ceAbstractionStarter]: For program point L3619(line 3619) no Hoare annotation was computed. [2019-10-22 11:27:27,887 INFO L439 ceAbstractionStarter]: At program point L4478(lines 4477 4536) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,887 INFO L443 ceAbstractionStarter]: For program point L4214(lines 4214 4254) no Hoare annotation was computed. [2019-10-22 11:27:27,887 INFO L439 ceAbstractionStarter]: At program point L5139(lines 5138 5140) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,887 INFO L439 ceAbstractionStarter]: At program point L5139-1(lines 5138 5140) the Hoare annotation is: (and (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base))) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (<= 1 ~ldv_urb_state~0)) [2019-10-22 11:27:27,887 INFO L443 ceAbstractionStarter]: For program point L5007(lines 5005 5024) no Hoare annotation was computed. [2019-10-22 11:27:27,887 INFO L443 ceAbstractionStarter]: For program point L5007-1(lines 5005 5024) no Hoare annotation was computed. [2019-10-22 11:27:27,887 INFO L439 ceAbstractionStarter]: At program point L5139-2(lines 5138 5140) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,888 INFO L439 ceAbstractionStarter]: At program point L5139-3(lines 5138 5140) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,888 INFO L439 ceAbstractionStarter]: At program point L4215(lines 4214 4254) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,888 INFO L439 ceAbstractionStarter]: At program point L5074(lines 4848 4851) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,888 INFO L439 ceAbstractionStarter]: At program point L4083-1(lines 4082 4112) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,888 INFO L439 ceAbstractionStarter]: At program point L4083(lines 4082 4112) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,888 INFO L443 ceAbstractionStarter]: For program point L4480(lines 4480 4536) no Hoare annotation was computed. [2019-10-22 11:27:27,888 INFO L439 ceAbstractionStarter]: At program point L4282-2(lines 4282 4290) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,889 INFO L443 ceAbstractionStarter]: For program point L3886(line 3886) no Hoare annotation was computed. [2019-10-22 11:27:27,889 INFO L443 ceAbstractionStarter]: For program point L4613(lines 4613 4616) no Hoare annotation was computed. [2019-10-22 11:27:27,889 INFO L439 ceAbstractionStarter]: At program point L4481(lines 4480 4536) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,889 INFO L443 ceAbstractionStarter]: For program point L4283(lines 4282 4290) no Hoare annotation was computed. [2019-10-22 11:27:27,889 INFO L439 ceAbstractionStarter]: At program point L5142(lines 1 5144) the Hoare annotation is: (and (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base))) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (<= 1 ~ldv_urb_state~0)) [2019-10-22 11:27:27,889 INFO L443 ceAbstractionStarter]: For program point L4217(lines 4217 4254) no Hoare annotation was computed. [2019-10-22 11:27:27,889 INFO L443 ceAbstractionStarter]: For program point L5142-1(lines 5142 5144) no Hoare annotation was computed. [2019-10-22 11:27:27,889 INFO L443 ceAbstractionStarter]: For program point L5142-2(lines 5142 5144) no Hoare annotation was computed. [2019-10-22 11:27:27,889 INFO L443 ceAbstractionStarter]: For program point L3887(lines 3887 3893) no Hoare annotation was computed. [2019-10-22 11:27:27,889 INFO L439 ceAbstractionStarter]: At program point L3821(lines 3808 3960) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,890 INFO L443 ceAbstractionStarter]: For program point L4812(line 4812) no Hoare annotation was computed. [2019-10-22 11:27:27,890 INFO L439 ceAbstractionStarter]: At program point L4218(lines 4217 4254) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,890 INFO L443 ceAbstractionStarter]: For program point L4284(lines 4284 4287) no Hoare annotation was computed. [2019-10-22 11:27:27,890 INFO L443 ceAbstractionStarter]: For program point L4152(lines 4152 4156) no Hoare annotation was computed. [2019-10-22 11:27:27,890 INFO L443 ceAbstractionStarter]: For program point L4152-2(lines 4152 4156) no Hoare annotation was computed. [2019-10-22 11:27:27,890 INFO L439 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-10-22 11:27:27,890 INFO L439 ceAbstractionStarter]: At program point L4879(lines 4811 4882) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,890 INFO L443 ceAbstractionStarter]: For program point L4483(lines 4483 4536) no Hoare annotation was computed. [2019-10-22 11:27:27,890 INFO L439 ceAbstractionStarter]: At program point L3625(lines 3614 3630) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,890 INFO L439 ceAbstractionStarter]: At program point L4484(lines 4483 4536) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,891 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:27:27,891 INFO L443 ceAbstractionStarter]: For program point L4220(lines 4220 4254) no Hoare annotation was computed. [2019-10-22 11:27:27,891 INFO L439 ceAbstractionStarter]: At program point L3956(lines 3806 3961) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,891 INFO L443 ceAbstractionStarter]: For program point L4551(lines 4551 4557) no Hoare annotation was computed. [2019-10-22 11:27:27,891 INFO L439 ceAbstractionStarter]: At program point L4221(lines 4220 4254) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,891 INFO L443 ceAbstractionStarter]: For program point L5014(lines 5014 5019) no Hoare annotation was computed. [2019-10-22 11:27:27,891 INFO L443 ceAbstractionStarter]: For program point L4023(lines 4023 4041) no Hoare annotation was computed. [2019-10-22 11:27:27,891 INFO L443 ceAbstractionStarter]: For program point L5014-2(lines 5014 5019) no Hoare annotation was computed. [2019-10-22 11:27:27,891 INFO L443 ceAbstractionStarter]: For program point L4816(lines 4816 4821) no Hoare annotation was computed. [2019-10-22 11:27:27,891 INFO L443 ceAbstractionStarter]: For program point L4486(lines 4486 4536) no Hoare annotation was computed. [2019-10-22 11:27:27,891 INFO L439 ceAbstractionStarter]: At program point L5081(lines 5080 5082) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,892 INFO L439 ceAbstractionStarter]: At program point L4883(lines 4810 4884) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,892 INFO L443 ceAbstractionStarter]: For program point L3826(line 3826) no Hoare annotation was computed. [2019-10-22 11:27:27,892 INFO L439 ceAbstractionStarter]: At program point L4487(lines 4486 4536) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,892 INFO L443 ceAbstractionStarter]: For program point L4157(lines 4157 4161) no Hoare annotation was computed. [2019-10-22 11:27:27,892 INFO L443 ceAbstractionStarter]: For program point L4157-2(lines 4157 4161) no Hoare annotation was computed. [2019-10-22 11:27:27,892 INFO L439 ceAbstractionStarter]: At program point L4025loopEntry(lines 4025 4035) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,892 INFO L443 ceAbstractionStarter]: For program point L4818(lines 4818 4821) no Hoare annotation was computed. [2019-10-22 11:27:27,892 INFO L443 ceAbstractionStarter]: For program point L3827(lines 3827 3833) no Hoare annotation was computed. [2019-10-22 11:27:27,892 INFO L443 ceAbstractionStarter]: For program point L4818-1(lines 4816 4821) no Hoare annotation was computed. [2019-10-22 11:27:27,892 INFO L443 ceAbstractionStarter]: For program point L4620(lines 4620 4623) no Hoare annotation was computed. [2019-10-22 11:27:27,892 INFO L443 ceAbstractionStarter]: For program point L4026(line 4026) no Hoare annotation was computed. [2019-10-22 11:27:27,893 INFO L439 ceAbstractionStarter]: At program point L4621(lines 4604 4634) 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-10-22 11:27:27,893 INFO L443 ceAbstractionStarter]: For program point L4489(lines 4489 4536) no Hoare annotation was computed. [2019-10-22 11:27:27,893 INFO L439 ceAbstractionStarter]: At program point L4291(lines 4281 4292) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,893 INFO L443 ceAbstractionStarter]: For program point L4027(lines 4027 4033) no Hoare annotation was computed. [2019-10-22 11:27:27,893 INFO L439 ceAbstractionStarter]: At program point L4490(lines 4489 4536) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,893 INFO L439 ceAbstractionStarter]: At program point L3896(lines 3808 3960) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,893 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:27:27,893 INFO L439 ceAbstractionStarter]: At program point L3699(lines 3687 3701) the Hoare annotation is: (and (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base))) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (<= 1 ~ldv_urb_state~0)) [2019-10-22 11:27:27,893 INFO L443 ceAbstractionStarter]: For program point L4492(lines 4492 4536) no Hoare annotation was computed. [2019-10-22 11:27:27,893 INFO L443 ceAbstractionStarter]: For program point L4162(lines 4162 4166) no Hoare annotation was computed. [2019-10-22 11:27:27,893 INFO L443 ceAbstractionStarter]: For program point L4162-2(lines 4162 4166) no Hoare annotation was computed. [2019-10-22 11:27:27,894 INFO L439 ceAbstractionStarter]: At program point L4493(lines 4492 4536) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,894 INFO L439 ceAbstractionStarter]: At program point L5088(lines 5087 5089) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,894 INFO L443 ceAbstractionStarter]: For program point L4825(lines 4825 4881) no Hoare annotation was computed. [2019-10-22 11:27:27,894 INFO L443 ceAbstractionStarter]: For program point L4495(lines 4495 4536) no Hoare annotation was computed. [2019-10-22 11:27:27,894 INFO L439 ceAbstractionStarter]: At program point L4297(lines 4261 4299) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,894 INFO L439 ceAbstractionStarter]: At program point L4826(lines 4825 4881) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,894 INFO L443 ceAbstractionStarter]: For program point L3901(line 3901) no Hoare annotation was computed. [2019-10-22 11:27:27,894 INFO L443 ceAbstractionStarter]: For program point L4562(lines 4562 4568) no Hoare annotation was computed. [2019-10-22 11:27:27,894 INFO L439 ceAbstractionStarter]: At program point L4496(lines 4495 4536) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,894 INFO L439 ceAbstractionStarter]: At program point L4364(lines 4300 4366) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,895 INFO L439 ceAbstractionStarter]: At program point L5091(lines 5090 5092) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,895 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4900) no Hoare annotation was computed. [2019-10-22 11:27:27,895 INFO L443 ceAbstractionStarter]: For program point L3902(lines 3902 3908) no Hoare annotation was computed. [2019-10-22 11:27:27,895 INFO L439 ceAbstractionStarter]: At program point L3836(lines 3808 3960) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,895 INFO L443 ceAbstractionStarter]: For program point L4167(lines 4167 4171) no Hoare annotation was computed. [2019-10-22 11:27:27,895 INFO L443 ceAbstractionStarter]: For program point L4167-2(lines 4167 4171) no Hoare annotation was computed. [2019-10-22 11:27:27,895 INFO L446 ceAbstractionStarter]: At program point L4894(lines 4787 4896) the Hoare annotation is: true [2019-10-22 11:27:27,895 INFO L443 ceAbstractionStarter]: For program point L4828(lines 4828 4881) no Hoare annotation was computed. [2019-10-22 11:27:27,895 INFO L443 ceAbstractionStarter]: For program point L4498(lines 4498 4536) no Hoare annotation was computed. [2019-10-22 11:27:27,895 INFO L439 ceAbstractionStarter]: At program point L4036(lines 3969 4051) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,895 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4900) no Hoare annotation was computed. [2019-10-22 11:27:27,896 INFO L439 ceAbstractionStarter]: At program point L4829(lines 4828 4881) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,896 INFO L439 ceAbstractionStarter]: At program point L3640(lines 3633 3642) the Hoare annotation is: (and (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base))) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (<= 1 ~ldv_urb_state~0)) [2019-10-22 11:27:27,896 INFO L439 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-10-22 11:27:27,896 INFO L439 ceAbstractionStarter]: At program point L4499(lines 4498 4536) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,896 INFO L439 ceAbstractionStarter]: At program point L5095(lines 5094 5096) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,896 INFO L443 ceAbstractionStarter]: For program point L4831(lines 4831 4881) no Hoare annotation was computed. [2019-10-22 11:27:27,896 INFO L443 ceAbstractionStarter]: For program point L4897-2(lines 5041 5046) no Hoare annotation was computed. [2019-10-22 11:27:27,896 INFO L446 ceAbstractionStarter]: At program point L4897-3(lines 5032 5049) the Hoare annotation is: true [2019-10-22 11:27:27,896 INFO L443 ceAbstractionStarter]: For program point L4897(lines 1 5144) no Hoare annotation was computed. [2019-10-22 11:27:27,896 INFO L443 ceAbstractionStarter]: For program point L4897-1(lines 1 5144) no Hoare annotation was computed. [2019-10-22 11:27:27,897 INFO L439 ceAbstractionStarter]: At program point L4633(lines 4602 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) (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0)) [2019-10-22 11:27:27,897 INFO L439 ceAbstractionStarter]: At program point L4501(lines 4500 4536) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,897 INFO L443 ceAbstractionStarter]: For program point L3841(line 3841) no Hoare annotation was computed. [2019-10-22 11:27:27,897 INFO L439 ceAbstractionStarter]: At program point L4832(lines 4831 4881) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,897 INFO L443 ceAbstractionStarter]: For program point L4172(lines 4172 4176) no Hoare annotation was computed. [2019-10-22 11:27:27,897 INFO L443 ceAbstractionStarter]: For program point L4172-2(lines 4172 4176) no Hoare annotation was computed. [2019-10-22 11:27:27,897 INFO L443 ceAbstractionStarter]: For program point L3974(lines 3974 3977) no Hoare annotation was computed. [2019-10-22 11:27:27,897 INFO L443 ceAbstractionStarter]: For program point L3842(lines 3842 3848) no Hoare annotation was computed. [2019-10-22 11:27:27,897 INFO L443 ceAbstractionStarter]: For program point L4900-1(line 4900) no Hoare annotation was computed. [2019-10-22 11:27:27,897 INFO L443 ceAbstractionStarter]: For program point L4834(lines 4834 4881) no Hoare annotation was computed. [2019-10-22 11:27:27,898 INFO L443 ceAbstractionStarter]: For program point L4900-2(line 4900) no Hoare annotation was computed. [2019-10-22 11:27:27,898 INFO L443 ceAbstractionStarter]: For program point L4900(line 4900) no Hoare annotation was computed. [2019-10-22 11:27:27,898 INFO L443 ceAbstractionStarter]: For program point L4900-3(line 4900) no Hoare annotation was computed. [2019-10-22 11:27:27,898 INFO L439 ceAbstractionStarter]: At program point L5099(lines 5098 5100) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,898 INFO L439 ceAbstractionStarter]: At program point L4835(lines 4834 4881) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,898 INFO L439 ceAbstractionStarter]: At program point L3911(lines 3808 3960) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,898 INFO L443 ceAbstractionStarter]: For program point L4374(lines 4374 4377) no Hoare annotation was computed. [2019-10-22 11:27:27,898 INFO L439 ceAbstractionStarter]: At program point L4110(lines 4084 4111) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,898 INFO L439 ceAbstractionStarter]: At program point L4110-1(lines 4084 4111) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,898 INFO L443 ceAbstractionStarter]: For program point L4837(lines 4837 4881) no Hoare annotation was computed. [2019-10-22 11:27:27,898 INFO L439 ceAbstractionStarter]: At program point L3714(lines 3711 3716) the Hoare annotation is: (and (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base))) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (<= 1 ~ldv_urb_state~0)) [2019-10-22 11:27:27,899 INFO L439 ceAbstractionStarter]: At program point L3714-1(lines 3711 3716) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,899 INFO L443 ceAbstractionStarter]: For program point L4177(lines 4177 4181) no Hoare annotation was computed. [2019-10-22 11:27:27,899 INFO L443 ceAbstractionStarter]: For program point L4177-2(lines 4177 4181) no Hoare annotation was computed. [2019-10-22 11:27:27,899 INFO L439 ceAbstractionStarter]: At program point L4838(lines 4837 4881) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,899 INFO L439 ceAbstractionStarter]: At program point L3649(lines 3643 3651) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,899 INFO L439 ceAbstractionStarter]: At program point L4113-1(lines 4053 4115) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,899 INFO L439 ceAbstractionStarter]: At program point L4113(lines 4053 4115) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,899 INFO L443 ceAbstractionStarter]: For program point L4378(lines 4378 4381) no Hoare annotation was computed. [2019-10-22 11:27:27,899 INFO L443 ceAbstractionStarter]: For program point L4378-2(lines 4378 4381) no Hoare annotation was computed. [2019-10-22 11:27:27,899 INFO L443 ceAbstractionStarter]: For program point L3916(line 3916) no Hoare annotation was computed. [2019-10-22 11:27:27,900 INFO L443 ceAbstractionStarter]: For program point L4577(lines 4577 4584) no Hoare annotation was computed. [2019-10-22 11:27:27,900 INFO L439 ceAbstractionStarter]: At program point L5106(lines 5105 5107) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,900 INFO L443 ceAbstractionStarter]: For program point L3917(lines 3917 3923) no Hoare annotation was computed. [2019-10-22 11:27:27,900 INFO L439 ceAbstractionStarter]: At program point L3851(lines 3808 3960) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,900 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:27:27,900 INFO L443 ceAbstractionStarter]: For program point L4182(lines 4182 4186) no Hoare annotation was computed. [2019-10-22 11:27:27,900 INFO L443 ceAbstractionStarter]: For program point L4182-2(lines 4182 4186) no Hoare annotation was computed. [2019-10-22 11:27:27,900 INFO L439 ceAbstractionStarter]: At program point L4050(lines 3962 4052) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,900 INFO L446 ceAbstractionStarter]: At program point L4909(lines 4909 4910) the Hoare annotation is: true [2019-10-22 11:27:27,900 INFO L446 ceAbstractionStarter]: At program point L4909-1(lines 4909 4910) the Hoare annotation is: true [2019-10-22 11:27:27,900 INFO L439 ceAbstractionStarter]: At program point L3720(lines 3717 3722) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,901 INFO L439 ceAbstractionStarter]: At program point L3720-1(lines 3717 3722) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,901 INFO L439 ceAbstractionStarter]: At program point L3985loopEntry(lines 3985 3995) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,901 INFO L443 ceAbstractionStarter]: For program point L4382(lines 4382 4385) no Hoare annotation was computed. [2019-10-22 11:27:27,901 INFO L439 ceAbstractionStarter]: At program point L5109(lines 5108 5110) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,901 INFO L443 ceAbstractionStarter]: For program point L3986(line 3986) no Hoare annotation was computed. [2019-10-22 11:27:27,901 INFO L443 ceAbstractionStarter]: For program point L3987(lines 3987 3993) no Hoare annotation was computed. [2019-10-22 11:27:27,901 INFO L439 ceAbstractionStarter]: At program point L4582(lines 4455 4598) the Hoare annotation is: (and (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.offset 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.base))) (<= ~ldv_urb_state~0 1) (= 0 ~ldv_coherent_state~0) (<= 1 ~ldv_urb_state~0)) [2019-10-22 11:27:27,901 INFO L439 ceAbstractionStarter]: At program point L4252(lines 4222 4254) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,901 INFO L443 ceAbstractionStarter]: For program point L3856(line 3856) no Hoare annotation was computed. [2019-10-22 11:27:27,901 INFO L439 ceAbstractionStarter]: At program point L4980loopEntry(lines 4980 4993) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,901 INFO L443 ceAbstractionStarter]: For program point L3857(lines 3857 3863) no Hoare annotation was computed. [2019-10-22 11:27:27,902 INFO L443 ceAbstractionStarter]: For program point L4056(lines 4056 4112) no Hoare annotation was computed. [2019-10-22 11:27:27,902 INFO L439 ceAbstractionStarter]: At program point L5113(lines 5112 5114) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,902 INFO L443 ceAbstractionStarter]: For program point L4056-1(lines 4056 4112) no Hoare annotation was computed. [2019-10-22 11:27:27,902 INFO L443 ceAbstractionStarter]: For program point L4981(line 4981) no Hoare annotation was computed. [2019-10-22 11:27:27,902 INFO L439 ceAbstractionStarter]: At program point L4321loopEntry(lines 4321 4336) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,902 INFO L439 ceAbstractionStarter]: At program point L4057-1(lines 4056 4112) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,902 INFO L439 ceAbstractionStarter]: At program point L4057(lines 4056 4112) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,902 INFO L443 ceAbstractionStarter]: For program point L4322(lines 4321 4336) no Hoare annotation was computed. [2019-10-22 11:27:27,902 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:27:27,902 INFO L439 ceAbstractionStarter]: At program point L3926(lines 3808 3960) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,902 INFO L443 ceAbstractionStarter]: For program point L4389(lines 4389 4392) no Hoare annotation was computed. [2019-10-22 11:27:27,902 INFO L443 ceAbstractionStarter]: For program point L4059-1(lines 4059 4112) no Hoare annotation was computed. [2019-10-22 11:27:27,903 INFO L443 ceAbstractionStarter]: For program point L4059(lines 4059 4112) no Hoare annotation was computed. [2019-10-22 11:27:27,903 INFO L439 ceAbstractionStarter]: At program point L5116(lines 5115 5117) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,903 INFO L439 ceAbstractionStarter]: At program point L4258(lines 4116 4260) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,903 INFO L439 ceAbstractionStarter]: At program point L4457loopEntry(lines 4457 4467) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,903 INFO L443 ceAbstractionStarter]: For program point L4325(line 4325) no Hoare annotation was computed. [2019-10-22 11:27:27,903 INFO L443 ceAbstractionStarter]: For program point L4986(lines 4986 4989) no Hoare annotation was computed. [2019-10-22 11:27:27,903 INFO L439 ceAbstractionStarter]: At program point L5052(lines 5051 5053) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,903 INFO L443 ceAbstractionStarter]: For program point L4458(line 4458) no Hoare annotation was computed. [2019-10-22 11:27:27,903 INFO L443 ceAbstractionStarter]: For program point L4062(lines 4062 4112) no Hoare annotation was computed. [2019-10-22 11:27:27,903 INFO L439 ceAbstractionStarter]: At program point L3996(lines 3969 4051) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,903 INFO L443 ceAbstractionStarter]: For program point L4062-1(lines 4062 4112) no Hoare annotation was computed. [2019-10-22 11:27:27,903 INFO L443 ceAbstractionStarter]: For program point L4459(lines 4459 4465) no Hoare annotation was computed. [2019-10-22 11:27:27,904 INFO L439 ceAbstractionStarter]: At program point L4063-1(lines 4059 4112) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,904 INFO L439 ceAbstractionStarter]: At program point L5120(lines 5119 5121) 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-10-22 11:27:27,904 INFO L439 ceAbstractionStarter]: At program point L4063(lines 4059 4112) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,904 INFO L443 ceAbstractionStarter]: For program point L3931(line 3931) no Hoare annotation was computed. [2019-10-22 11:27:27,904 INFO L439 ceAbstractionStarter]: At program point L4196(lines 4138 4197) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,904 INFO L443 ceAbstractionStarter]: For program point L3932(lines 3932 3938) no Hoare annotation was computed. [2019-10-22 11:27:27,904 INFO L439 ceAbstractionStarter]: At program point L3866(lines 3808 3960) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-10-22 11:27:27,904 INFO L443 ceAbstractionStarter]: For program point L4131(lines 4131 4137) no Hoare annotation was computed. [2019-10-22 11:27:27,920 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,921 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,921 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,922 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,922 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,922 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,930 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,930 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,930 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,931 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,931 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,931 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,931 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,932 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,932 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,940 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,940 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,940 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,942 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,942 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,943 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,943 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,943 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,943 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,944 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,944 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,944 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,945 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,945 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,945 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,946 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,946 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,946 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,947 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,947 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,947 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,959 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,959 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,959 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,960 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,960 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,960 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:27,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:27:27 BoogieIcfgContainer [2019-10-22 11:27:27,969 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:27:27,970 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:27:27,970 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:27:27,970 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:27:27,970 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:17" (3/4) ... [2019-10-22 11:27:27,973 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:27:28,009 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 131 nodes and edges [2019-10-22 11:27:28,011 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 64 nodes and edges [2019-10-22 11:27:28,012 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2019-10-22 11:27:28,014 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-10-22 11:27:28,015 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 11:27:28,016 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:27:28,018 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-10-22 11:27:28,019 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-10-22 11:27:28,052 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == ldv_coherent_state && \result == 0) && \result == 0) && ldv_urb_state == 0) || (((ldv_urb_state <= 1 && (!(\result == 0) || !(\result == 0))) && 0 == ldv_coherent_state) && 1 <= ldv_urb_state) [2019-10-22 11:27:28,343 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_07bb38f3-0f08-4f5d-b1f7-786922a06892/bin/utaipan/witness.graphml [2019-10-22 11:27:28,343 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:27:28,348 INFO L168 Benchmark]: Toolchain (without parser) took 15489.52 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 567.8 MB). Free memory was 936.3 MB in the beginning and 999.5 MB in the end (delta: -63.3 MB). Peak memory consumption was 504.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:28,348 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:27:28,348 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1276.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 934.9 MB in the beginning and 1.1 GB in the end (delta: -129.2 MB). Peak memory consumption was 41.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:28,349 INFO L168 Benchmark]: Boogie Procedure Inliner took 137.56 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: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:28,349 INFO L168 Benchmark]: Boogie Preprocessor took 87.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: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:28,349 INFO L168 Benchmark]: RCFGBuilder took 3066.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 70.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -102.3 MB). Peak memory consumption was 177.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:28,349 INFO L168 Benchmark]: TraceAbstraction took 10543.22 ms. Allocated memory was 1.3 GB in the beginning and 1.6 GB in the end (delta: 340.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -29.6 MB). Peak memory consumption was 425.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:28,350 INFO L168 Benchmark]: Witness Printer took 373.62 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 999.5 MB in the end (delta: 176.3 MB). Peak memory consumption was 176.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:28,351 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1276.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 934.9 MB in the beginning and 1.1 GB in the end (delta: -129.2 MB). Peak memory consumption was 41.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 137.56 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: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 87.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: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3066.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 70.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -102.3 MB). Peak memory consumption was 177.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10543.22 ms. Allocated memory was 1.3 GB in the beginning and 1.6 GB in the end (delta: 340.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -29.6 MB). Peak memory consumption was 425.5 MB. Max. memory is 11.5 GB. * Witness Printer took 373.62 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 999.5 MB in the end (delta: 176.3 MB). Peak memory consumption was 176.3 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: 4900]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4900]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4900]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4900]: 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: 4282]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3643]: 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: 5126]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4080]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4837]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4320]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4080]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4455]: Loop Invariant Derived loop invariant: (((!(urb == 0) || !(0 == urb)) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && 1 <= ldv_urb_state - InvariantResult [Line: 3808]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5115]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4077]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4834]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5090]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5112]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4077]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4001]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3717]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4220]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3717]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4498]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5134]: Loop Invariant Derived loop invariant: (((!(urb == 0) || !(0 == urb)) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && 1 <= ldv_urb_state - InvariantResult [Line: 4811]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3808]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3633]: Loop Invariant Derived loop invariant: (((!(urb == 0) || !(0 == urb)) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && 1 <= ldv_urb_state - InvariantResult [Line: 3808]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - 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: 4909]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4138]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3666]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4831]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5087]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5076]: Loop Invariant [2019-10-22 11:27:28,360 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,367 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,367 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,367 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,367 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,367 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: 4074]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5098]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4300]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4074]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4909]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4848]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4071]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4071]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4828]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3962]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4082]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4082]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4495]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4975]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && \result == 0) && \result == 0) && ldv_urb_state == 0) || (((ldv_urb_state <= 1 && (!(\result == 0) || !(\result == 0))) && 0 == ldv_coherent_state) && 1 <= ldv_urb_state) - InvariantResult [Line: 4217]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5051]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4492]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4214]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3711]: Loop Invariant Derived loop invariant: (((!(urb == 0) || !(0 == urb)) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && 1 <= ldv_urb_state - InvariantResult [Line: 5005]: Loop Invariant Derived loop invariant: (((!(urb == 0) || !(0 == urb)) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && 1 <= ldv_urb_state - InvariantResult [Line: 4025]: 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: 4065]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3969]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5059]: Loop Invariant Derived loop invariant: (((!(urb == 0) || !(0 == urb)) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && 1 <= ldv_urb_state - InvariantResult [Line: 3711]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5005]: Loop Invariant Derived loop invariant: (((!(urb == 0) || !(0 == urb)) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && 1 <= ldv_urb_state - InvariantResult [Line: 3808]: 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: 4456]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4211]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3806]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4980]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4825]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4065]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4053]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4053]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5035]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4084]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3808]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3810]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 1]: Loop Invariant [2019-10-22 11:27:28,371 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,372 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,372 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,372 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,375 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,375 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: 4602]: Loop Invariant [2019-10-22 11:27:28,375 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,376 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,376 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,376 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,376 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,376 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: 4084]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4500]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4489]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4502]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4486]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5032]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4261]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4059]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4208]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4483]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3677]: Loop Invariant [2019-10-22 11:27:28,377 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,377 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,377 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,378 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,378 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,378 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: 4205]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5119]: Loop Invariant [2019-10-22 11:27:28,378 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,378 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,379 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,379 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,379 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,379 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: 4059]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5108]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((!(urb == 0) || !(0 == urb)) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && 1 <= ldv_urb_state - InvariantResult [Line: 5130]: Loop Invariant [2019-10-22 11:27:28,380 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,380 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,380 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,380 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,380 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,381 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: 3808]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5105]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5138]: Loop Invariant Derived loop invariant: (((!(urb == 0) || !(0 == urb)) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && 1 <= ldv_urb_state - InvariantResult [Line: 5094]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4787]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3808]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4810]: 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: 5138]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5138]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5138]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4056]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4116]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4056]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4281]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5080]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4480]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4202]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4199]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3808]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4477]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3687]: Loop Invariant Derived loop invariant: (((!(urb == 0) || !(0 == urb)) && ldv_urb_state <= 1) && 0 == ldv_coherent_state) && 1 <= ldv_urb_state - InvariantResult [Line: 3608]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4604]: Loop Invariant [2019-10-22 11:27:28,383 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,383 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,384 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,384 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,384 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:27:28,384 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: 4265]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 5055]: 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: 4321]: 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: 3808]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3985]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3969]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4222]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4474]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 275 locations, 4 error locations. Result: SAFE, OverallTime: 10.4s, OverallIterations: 12, TraceHistogramMax: 2, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, HoareTripleCheckerStatistics: 5782 SDtfs, 4682 SDslu, 7154 SDs, 0 SdLazy, 579 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2505occurred 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.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 3552 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 128 LocationsWithAnnotation, 128 PreInvPairs, 894 NumberOfFragments, 1218 HoareAnnotationTreeSize, 128 FomulaSimplifications, 131401 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 128 FomulaSimplificationsInter, 30 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 539 NumberOfCodeBlocks, 539 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 527 ConstructedInterpolants, 0 QuantifiedInterpolants, 68503 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...